资源列表
GenTrigonometrixFuncSet
- GenTrigonometrixFuncSet:产生三角函数转换表的代码.
find_nearest_neighbours
- ％ [nearest_neighbours] = find_nearest_neighbours( database, desc, max_dist ) ％ Find the indices of the nearest neighbours of the given desriptors in the近邻点寻找算法，在非线性时间序列中很有用，是常用的算法
akm
- 阿克曼函数，一种十分有效的函数，在数据结构中使用得多。
dctFFTW
- 基于fftw的dct程序，FFTW是一个快速的免费的基于c语言的FFT 库-A fast, free C FFT library includes real-complex, multidimensional, and parallel transforms.
zz
- 这一算法实现了堆存存储结构的串的置换操作REPLACE(&S,T,V)-This algorithm achieved a stockpiling storage structure of the string replacement operation REPLACE (& S, T, V)
Circular_Queue_Implementation_using_Arrays
- Circular Queue Implementation using Arrays
VC-least-squares-curve-fitting-
- 关于VC的最小二乘法曲线拟合程序，有兴趣可以一试，进行调试-Least squares curve fitting program
mult_15_5X3
- 实现BCH15X15bit乘法器，树形结构，采用分模块技术，相较于Mastrovito方法节省了40 的资源。-BCH15X15bit multiplier tree structure, the use of sub-module technology, compared to Mastrovito save 40 of the resources.
Jump
- Predictor corrector method
telnumber
- 对电话号码的处理 是输入的电话号码满足一定的格式-The processing of the telephone number is input and p satisfies a certain format
cunchujiegou
- 采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。 -Adjacency matrix storage to the network, to establish a network and single-source shortest path algorithm.
bellFord-(2)
- BellFord 算法，查找图的最短路径，C++代码实现-BellFord algorithm, find out the shortest path of figure and c++ code implementation