-
matlab_code
mimo capacity matlab implementation and water filling algo for optimal power distribution
- 2010-06-02 00:21:37下载
- 积分：1
-
sift
用于图像精确匹配以及目标检测的SIFT算法(Sift algorithm matlab version for object detection and image match)
- 2009-09-16 20:05:03下载
- 积分：1
-
ACATSP
利用MATLAB编写蚁群算法求解城市最佳路线的一个例子(Ant colony algorithm for an example of the city the best route)
- 2012-05-04 21:43:42下载
- 积分：1
-
Untitled5
matlab关于NURBS插补程序的生成以及相关算法的实现(matlab program for the generation of NURBS interpolation algorithm and related implementation
)
- 2020-12-10 16:59:20下载
- 积分：1
-
dn627
这是第二能量熵的matlab代码，光纤陀螺输出误差的allan方差分析，小波包分析提取振动信号中的特征频率。( This is the second energy entropy matlab code, allan FOG output error variance analysis, Wavelet packet analysis to extract vibration signal characteristic frequency.)
- 2017-03-28 18:57:27下载
- 积分：1
-
audiosteg
segmenting the audio signal using this m file
- 2009-12-28 18:03:31下载
- 积分：1
-
automatic-modulation-recognition
A.K.Nandi和E.E.Azzouz的期刊文献，是关于自动调制识别的经典文章，他们在基于模式识别方式上提出的自动识别的几个特征参数，是当前该领域研究的基础，对该领域研究来说有很大参考价值。(AKNandi and EEAzzouz of journal articles, is about the automatic modulation recognition of the classic article, based on pattern recognition in the way they presented the automatic identification of several characteristic parameters, is the basis of current research in this field, research in this area is a great reference value.)
- 2011-06-11 14:51:57下载
- 积分：1
-
kfcm
it is a code for kernel-FCM clustering
- 2011-12-04 23:33:47下载
- 积分：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
-
codebook_iteration2
说明： 利用通用 Lloyd Algorithm 方法生成功率码本的程序(the code of generating the codebook of power allocation by Generalized Lloyd Algorithm )
- 2011-02-21 21:50:34下载
- 积分：1
