-
k-means-for-iris
说明： 利用K均值聚类对鸢尾花样本进行聚类的matlab程序，包含源代码、样本数据、聚类结果(The matlab program of clustering iris samples by K-means clustering, including source code, sample data and clustering results)
- 2020-10-17 20:27:27下载
- 积分：1
-
40609537
实现了先来先服务算法,可以作为大家学习的参考(First come first served algorithm is realized, which can be used as a reference for us to learn.)
- 2018-11-10 13:53:00下载
- 积分：1
-
三维装箱MATLAB版
三维装箱程序，MATLAB实现，可以使用，但是没有优化，时间较长(3D packing program, realized by MATLAB, can be used, but it has not been optimized and takes a long time.)
- 2020-11-16 13:29:42下载
- 积分：1
-
kpath
数组排序,按照数组的某个元素进行排序,使用请查看(Sort the array, in accordance with a certain element of the array to sort, the use of please see)
- 2008-07-11 13:42:22下载
- 积分：1
-
rop_matlab1
利用宽度有限方法（BFS）寻找最短路径和最小树的算法和算例。(Use of finite width method (BFS) to find the shortest path and minimum tree algorithms and numerical examples.)
- 2015-01-18 21:08:11下载
- 积分：1
-
FNN与PCA和KPCA结合
一种特征提取方法：结合主元分析(PCA)和核主元分析（KPCA）的前馈神经网络（FNN）(A feature extraction method: the feedforward neural network (FNN) combined with principal component analysis (PCA) and kernel principal component analysis (KPCA))
- 2020-09-18 10:27:53下载
- 积分：1
-
07611407
提供一个求解庞加莱映射的方法,分享相关的程序,互相学习,(To provide a solution to the Poincare mapping, to share programs, to learn from each other,)
- 2018-09-11 23:16:07下载
- 积分：1
-
floyd
floyd，求最短路径的算法。。求任意两点间的最短距离(floyd, seeking the shortest path algorithms. . Arbitrary order of the shortest distance between two points)
- 2008-07-28 09:40:20下载
- 积分：1
-
Huffman
哈弗曼编码，构造哈夫曼树，构造哈夫曼树非常简单，将所有的节点放到一个队列中，用一个节点替换两个频率最低的节点，新节点的频率就是这两个节点的频率之和。这样，新节点就是两个被替换节点的父节点了。如此循环，直到队列中只剩一个节点（树根）。(Hoffman coding, Huffman tree structure, Huffman tree structure is very simple, all the nodes in a queue, replace the two lowest frequency node with a node, the new node and the frequency of frequency is the two nodes. So, the new node is two replaced node parent node. So the cycle, until the queue is only one node (Shu Gen).
)
- 2013-11-13 14:20:00下载
- 积分：1
-
超大整型数据的加减乘C实现
本程序主要是针对超大整型数据的基础加、减、乘运算，运算位数可达10000位，同时也支持使用者进行修改扩展至更大位数
- 2023-08-28 18:15:03下载
- 积分：1
