资源列表
Clustering433
- 一个对初学者非常实际非常方便的矢量量化的C语言实现 ,值得-one pair of very real beginners very convenient vector quantization C language, it is worth a look at
ica453
- Demonstration and test of the kernel-ica package
LVQ
- LVQ(学习矢量量化)算法：它是Kohonen的有监督学习的扩展形式。融合了自组织和有导师监督的技术，学习方法是竞争的，但产生方式是有教师监督的，也就是说，竞争学习是在由训练输入指定的各类中局部进行。-LVQ (LVQ) algorithm : it is Kohonen of supervised learning the expansion of the form. The convergence of self-organization and supervision of the ins
RLCX
- Kohonen的SOFM(自组织特征映射)：这种算法部分收到生物特征影响，在网络输出层内按几何中心或特征进行聚类。-Kohonen the SOFM (self-organizing feature map) : This algorithm received some biological features, the output layer to the network within the geometric center or cluster features.
dynamic knapsack
- 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, but its simplicity is incomparab
gelei generator
- 该程序用递归的方法产生格雷码序列,它需要一定的额外的空间.-the procedures used recursive methods Gray code sequence, it needs the additional space.
gelei combination
- 该程序用格雷码来生成组合数序列,它比一般的方法要快,这是由格雷码的分布特性所决定的.-the procedures used to generate Gray code sequence portfolio, it generally means than to be fast, it was a Gray code distribution by the decision.
distsort
- 该程序是分布计数排序，它是我所见过的各种排序方法中最快的，它的时间复杂度为O(n),但是这种排序适用于已知待排序列的上下限，并且如果上限与下限的差值比较大的话，空间消耗也比较大．-distribution of the program is counting sequencing, it is I have seen the fastest sorting methods, it's time complexity of O (n), but this sort known to be
echsh
- 二叉树的各种遍历。递归和非递归遍历以及层次遍历。-the binary tree traversal. And recursive and non - recursive traversal level traverse.
五种排序算法
- 是一个算法的小小汇总，使用ｖｂ语言编写，适合初学者学习。-algorithm is a little summary, the use of vb language, suitable for beginners to learn.
防止密码被非法获取
- 防止密码被非法获取
FastHF
- 惠普实验室的经典代码。用于huffman编码的快速实现，具有参考价值-HP Labs classic code. Huffman coding for the rapid realization of value with reference