资源列表
C_adaboost
- adaboost算法源码，Adaboost是一种迭代算法，其核心思想是针对同一个训练集训练不同的分类器(弱分类器)，然后把这些弱分类器集合起来，构成一个更强的最终分类器（强分类器），通过测试可以运行-adaboost algorithm source code, Adaboost is an iterative algorithm, the core idea is the same training set for different classifiers (weak classifiers
GRNN
- GNNN数据预测是基于广义回归神经网络货运预测，神经网络案例分析里的例程-GNNN data prediction- based on generalized regression neural network cargo forecasts, neural network case study in the routine
picture-Encrypt
- 图像加密 傅里叶变换 置乱变换 数字图像处理 加密解密算法-Image encryption scrambling transformation encryption and decryption algorithms of digital image processing
FEMforLaplace
- 有限单元法用于求解Laplace方程Fortran源程序-Finite element method for solving the Laplace equation
self-avoid-walk
- 改程序是用来解决蒙特卡罗模拟中最简单的自回避行走模型的-Change program is used to solve the simplest since avoid walking in monte carlo simulation model
KMP
- 字符串处理之KMP算法，适用于参加ACM程序设计竞赛的同学-The KMP string processing algorithm applied to participate in ACM Programming Contest for students
acm_bignumber
- 大数加法和大数乘法的算法，ACM初学者必备，进位的思想-Addition of large numbers and rounded multiplication algorithm, ACM beginners must carry the idea of
DDS-16bit
- Simulation of direct digital synthesis sine wave in the MathCAD (10 bit ADC, 16-bit accumulator, 12-bit ROM, the clock frequency of 25MHz)
ColorFetch
- 目标颜色识别.转换到hsv空间进行颜色分类。-object color recognize
uva making change C++代码
- uva making change C++代码
lab1
- 实验一：分治算法归并排序与快速排序平均时间之比较 （验证型实验） 实验目标： （1） 通过实验比较归并排序与快速排序算法在平均情况下哪一个更快。 （2） 加深对时间复杂度概念的理解。-Experiment one: divide and conquer algorithm merge sort and quick sort compare the average time (confirmatory test) test objectives: (1) Comparing a me
lab2
- 动态规划法的应用 1．用动态规划法实现两个虚拟DNA序列的比对。 2．记分方法为：匹配给5分，不匹配给1分，插入、删除给－2分。 要求生成的比对具有最大总和。-The application of a dynamic programming method. Using dynamic programming method to achieve two virtual DNA sequence comparison. 2. Scoring method: match to 5 po