-
threshold_segmentation
Simple threshold segmentation of medical CT data in DICOM data representation.
- 2009-03-17 21:50:58下载
- 积分：1
-
IsomapR1
流形学习 matlab开发的图形界面 集成了八个算法和十几个例子(Manifold learning matlab integrated graphical interface developed eight algorithms and more than a dozen examples)
- 2008-03-13 14:22:23下载
- 积分：1
-
parallel_iterative_deconvolution-1.9-bin
hi , i am a sudent in american- libanaise university
- 2012-03-30 16:38:26下载
- 积分：1
-
matlableach
说明： 无线传感器网络Leach分簇算法源代码，用matalb仿真的，完全能跑出来(wireless sensor network )
- 2011-03-28 17:06:01下载
- 积分：1
-
Huffman
this function perform huffman coding and decoding on image by using matlab program ..
- 2011-07-14 21:14:20下载
- 积分：1
-
DCDCconverter
Dc Dc converter circuit
- 2011-12-12 18:34:20下载
- 积分：1
-
chap4
自适应控制使用李雅普诺夫推导自适应律的学习程序(Adaptive control uses Lyapunov to derive adaptive law)
- 2019-05-24 21:03:39下载
- 积分：1
-
maxcost
“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
(" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
- 2010-12-22 17:27:32下载
- 积分：1
-
Electric-Machines-Analysis-and-Design-Applying-MA
Electric Machines Analysis and Design Applying MATLAB
- 2013-07-10 14:19:08下载
- 积分：1
-
ANT
蚁群优化算法解决tsp问题基本matlab源码(Ant colony optimization algorithm to solve the problem tsp basic matlab source)
- 2008-01-05 09:46:53下载
- 积分：1
