-
RepeatFCM
matlab编写的聚类算法代码，包含常用的各种聚类方法，可以作为聚类的程序包，有很好的使用和参考价值(matlab for clusterings)
- 2009-03-16 21:07:19下载
- 积分：1
-
MY_TBD
TBD 检测前跟踪；原创；仿真经典算法；一个文件产数据，一个文件积累（同时含有恒虚警检测程序）(TBD pre-test track original classical simulation algorithms a production data file, a file accumulated (and with CFAR program))
- 2011-09-10 01:18:30下载
- 积分：1
-
jimenez
programa que genera figuras aleatorias
- 2013-05-15 21:55:48下载
- 积分：1
-
mobkas
application sales car ............................
- 2015-01-12 16:56:55下载
- 积分：1
-
tuxiangfenge-ZIP
图像分割程序，包含roberts，sobel和prewitt算法，很好用！(Image segmentation procedures, contains Roberts, Sobel and Prewitt algorithm, very good!)
- 2013-04-27 16:16:52下载
- 积分：1
-
slidefilter
Sliding Sum Averaging Filter
Smoothes data by sliding it past itself, one sample at a time, and summing.
The length of the output is the same as the length of the input. The output
will be normalized. Equivalent to a moving average (lowpass) filter, but
more efficient.
- 2010-01-29 16:57:32下载
- 积分：1
-
vva
有很多频谱细化的程序 大家一起学习！！都是来自论坛上的贴子 很好用 有很大的启发性
- 2009-07-02 14:28:15下载
- 积分：1
-
examen-2
tecnicas de preprocesamiento matlab
- 2012-05-10 11:04:12下载
- 积分：1
-
MMm
最简单的matlab排队论的资料 大家喜欢的额话随便下载 如果能够对你有用这就是这段代码的最大价值了(The most simple matlab queuing theory You like the words literally download If it can be useful to you this is the maximum value this code)
- 2014-09-10 11:05:40下载
- 积分：1
-
Matlab_zuixiaofeiyong
最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
- 2012-07-27 14:55:22下载
- 积分：1
