搜索资源列表
Minimum-phase
- minimum phase in the communication system
用动态规划算法思想求最小编辑距离
- 用动态规划算法思想求最小编辑距离，即近似字符串匹配问题,Thinking of using dynamic programming algorithm for the minimum edit distance, that is, approximate string matching problem
Minimum-code-distance 用C语言编写的求二进制数的最小码距
- 用C语言编写的求二进制数的最小码距。思路清晰，结构明了。适合初学者对C语言的了解与掌握。-Written in C language, the minimum code requirements from the binary number. Clear thinking, clear structure. Suitable for beginners to understand and master the C language.
3_MinCut.rar
- 一个经典的求解最大流最小割代码 VC++版本,A classical solution of maximum flow minimum cut code VC++ Version
最小费用最大流算法通用Matlab程序
- 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 ％ 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 ％ 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 ％ 确定,如此多次迭代,最终得到最小费用最大流.,Basic ideas: to each arc on the unit cost of traffic as some length, with Floyd for the most shor
the_tree.rar
- matlab实现的最小生成树的两种最基本的算法即Kruskal，Prim。,matlab realization of the minimum spanning tree algorithm that is, the two most basic Kruskal, Prim.
ACM_template.rar
- 本人参加ACM竞赛使用的一些算法模板，包括二分图匹配，欧拉回路的构造以及网络流中的最大流与最小费用最大流等，可以说实战性非常强。,ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and mini
opf
- 最小费用最大流的一个实验程序,可以根据具体问题来重新修改-Minimum cost maximum flow in an experimental procedure may be based on specific issues to re-modify the
matlab
- floyd最短路算法&求网络的最小费用最大流&匈牙利算法&求网络的最小费用最大流-Floyd s short for network algorithm and the minimum cost flow and Hungary algorithm for the minimum cost and maximum flow network
mRMRFeatureSelection
- mRMR_0.9_compiled最小冗余和最大相关特征选取源代码，-This package is the mRMR (minimum-redundancy maximum-relevancy) feature selection method, whose better performance over the conventional top-ranking method has been demonstrated on a number of data sets in recent pu
MVDR_beam
- 波束形成算法中的最小方差无失真响应波束形成器，并在一个图中给出常规波束和MVDR两种波形。 -Beamforming algorithm in the minimum variance distortionless response beamformer and give a diagram of conventional beamforming and MVDR two waveforms.
judger
- 最小错误率和最小风险贝叶斯分类器，附带示例数据-Minimum error rate and minimum risk Bayes classifier, with sample data
Minimum-spanning-tree
- Kruskal算法和Prim算法 任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通). 加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和. 最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm Any edge of only by G, is composed of all the vertices containing G tree called G of the spannin
gmskModulationDemodulation
- 这是GMSK(高斯最小频移键控)的MATLAB仿真源程序-This is the GMSK (Gaussian Minimum Shift Keying) and MATLAB simulation source
Prim-minimum-spanning-tree-algorithm
- 最小生成树Prim算法的matlab文件，无论是在数据结构还是在图论中都有广泛的应用-Prim minimum spanning tree algorithm matlab file, whether in data structures or graph theory, there are a wide range of applications
K-degree-constrained-minimum-spanning-tree
- 本压缩包完整地实现了最小可度限制生成树的算法程序，代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete.
cut-the-minimum-cut-problem
- cut 最小割问题 网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T，使s Î S ， t Î T ，且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割 cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-cut the minimum cut problem network G = (V, E)
function minimum
- Finding fuction minimum and maximum
minimum filter
- low pass minimum filter
82429-minimum-row-value-and-return-the-row
- Minimum row value and return row