-
disanci
清音的对数幅度谱,短时过零率,平均能量,基音周期(Voiceless logarithmic amplitude spectrum, short-term zero crossing rate, average energy, pitch period)
- 2010-05-14 20:15:55下载
- 积分:1
-
acatsp
用蚂蚁算法智能的解决大规模TSP问题,有大量测试用例,图形化的展示运行过程。(Intelligent use of ant algorithm to solve large-scale TSP problem, a large number of test cases, graphical display of running.)
- 2011-08-18 12:06:48下载
- 积分:1
-
MATLABhelpinchinese
MATLAB中文实用手册,MATLAB中文帮助。(Chinese Practical Handbook MATLAB, MATLAB Chinese help.)
- 2015-04-03 18:18:44下载
- 积分:1
-
ITD
一个类似于经验模态分解的固有时间尺度分解,可以很好的和emd分解进行比较学习,程序代码完全可以运行,不缺少任何代码(A similar to the intrinsic time scale decomposition of empirical mode decomposition, the comparative study can be very good and the emd decomposition, the program code can be run completely, does not lack any code)
- 2017-04-13 21:24:23下载
- 积分:1
-
principlecomanalysis
通过matlab用两种方法实现主成分分析(Matlab two ways, through the achievement of principal component analysis)
- 2009-05-16 05:41:45下载
- 积分:1
-
viterbi-3.0.1
This file contains a C++ based source code for an optimized Viterbi decoder.
- 2014-11-24 17:42:30下载
- 积分:1
-
qh737
在matlab环境中自动识别连通区域的大小,时间序列数据分析中的梅林变换工具,用MATLAB实现的压缩传感。( Automatic identification in the matlab environment the size of the connected area, Time series data analysis Mellin transform tool, Using MATLAB compressed sensing.)
- 2017-03-23 13:00:08下载
- 积分:1
-
matlab
matlab下的数字图象处理例程,其中有关图片文件只要随便找个图片就可以了(matlab under the digital image processing routines, including the relevant picture file as long as you can not find a picture of the)
- 2007-11-06 21:38:49下载
- 积分:1
-
11
说明: 用Maple和MATLAB解决科学计算问题(第三版).pdf(Using Maple and MATLAB to solve problems in scientific computing (third edition). Pdf)
- 2008-08-15 11:38:55下载
- 积分:1
-
GraphTheoryAlgorithmMATLAB
说明: 图论算法及其MATLAB 程序代码
1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法
2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法
3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法
6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
- 2010-03-28 15:39:29下载
- 积分:1