-
biMatichHungary
说明： 偶图最大匹配完全照算法说明利用集合运算实现的matlab代码。这里需要大家讨论的是增广路的选取的算法，希望朋友们多多讨论，争取找一种更好的增广路方法，有想法的一定告诉我，谢谢，jxrhhu@hhu.edu.cn(Bipartite graph maximum matching algorithm description completely according to the use of computing to achieve a collection of matlab code. Here we need to discuss is the way to broaden the selection of the algorithm, a lot of friends who wish to discussions in order to find a better way to broaden the way, there is a certain mind to tell me, thank you, jxrhhu@hhu.edu.cn)
- 2008-10-11 20:03:46下载
- 积分：1
-
Cluster_flag
先随机找寻一个合理的初始划分，然后试探将样本从一个群搬到另一个群，如果某次搬动能使准则函数值得到改进的话，则继续搬运，否则废除本次搬运，再继续其他搬运。(Randomly and find a reasonable initial division, and then test the sample from a group of moving to another group, if a move can make the criterion function is worth to improve, it continues to handling, otherwise the abolition of the handling, continue to other handling.)
- 2012-12-28 16:30:37下载
- 积分：1
-
simbubble
simulation of ultrasonic cavitation. to use with RP function file in order to plot bubble radius time development.
- 2011-08-25 23:34:50下载
- 积分：1
-
untitled
this is file for traffic networks benchmarks...
- 2013-03-11 15:34:27下载
- 积分：1
-
rfft
the code file that is uploded is rfft file
- 2014-01-02 17:42:56下载
- 积分：1
-
ilcexample
说明： 迭代学习控制的matlab算法，看看对大家伙有没有帮助(Matlab iterative learning control algorithm to see if there is no help for the big guys)
- 2011-04-09 19:54:46下载
- 积分：1
-
gmm20140411
MIE散射，金属球光散射计算程序,可自行编写修改输入参数的可靠程序( light scattering of metal balls calculation program by mie)
- 2014-11-21 21:08:54下载
- 积分：1
-
DSP
用matla实现的关于数字信号处理的功能程序，各个模块的程序使用起来十分方便。(With regard to a digital signal processing function program matla implemented, the program of each module very convenient to use.)
- 2014-11-25 09:17:00下载
- 积分：1
-
PCA
用matlab实现的PCA算法，用于人脸检测和识别，人脸图像的特征提取(algorithm of PCA of face detection by matlab)
- 2012-11-20 19:56:56下载
- 积分：1
-
k_means
k means techniques de classification non supervisée (clustering) les plus utilisées.
Etant donné un entier K, K-means partitionne les données en K groupes, ou "clusters", ou "classes" ne se chevauchant pas. Ce résultat est obtenu en positionnant K "prototypes", ou "centroï des" dans les régions de l espace les plus peuplées. Chaque observation est alors affectée au prototype le plus proche (règle dite "de la Distance Minimale"). Chaque classe contient donc les observations qui sont plus proches d un certain prototype que de tout autre prototype
- 2010-08-05 23:34:13下载
- 积分：1
|
联系客服（QQ：3324461878）
