搜索资源列表
acbm
- AC-BM算法的实现的压缩包，很流行的字符串匹配算法，已经测试，-AC-BM algorithm for the realization of the compressed, the very popular string matching algorithm has been tested,
matchfilter
- 匹配滤波的MATLAB实现，用于随机信号处理的算法演示！-matched filtering of MATLAB for random signal processing algorithm demo!
erfenpipei
- 此文件包含某大学ACM暑期培训课程中关于二分匹配的讲义ppt和匈牙利算法代码。
KMPMatch
- 经典算法实现，KMP字符串匹配，环境为vc2005
MPTK-Windows-bin-0-5-4-beta
- 基于c语言实现了当前比较先进的算法－MP算法（匹配追踪）。
random_algorithm
- 一种采用数学方法实现的字符串匹配算法-模式匹配的随机算法。
5058591kmMatch
- KM算法，二分图匹配算法，匈牙利算法，给定加权矩阵，计算匹配策略-KM algorithm, bipartite graph matching algorithm, the Hungarian algorithm, for a given weight matrix to calculate matching strategy
OMP
- 正交匹配追踪算法，用于稀疏信号恢复，包括算法与实验-sparse signal recovery orthogonal matching pursuit
zuixiaoerchengdiedai
- 这是最小二乘迭代算法，能够实现匹配时的同名点反复迭代，提高匹配精度-This is the least-squares iterative algorithm that can achieve the same title match point when repeated iteration to improve the matching accuracy
xqq
- 二分图最大完美匹配算法，里面有具体例子的说明，实用性很强的-二分图最大完美匹配算法
esm
- 多关键词匹配算法,论坛等网络应用中非常有用-Multi-keyword matching algorithm, the forum is very useful for other network applications
MaximumMatching
- 用匈牙利算法实现的任务分配程序，对随机生成的矩阵求出最大匹配-Hungarian algorithm with task allocation procedures, randomly generated matrix of the maximum matching obtained
TWO-PART-ALGORTIHM
- 本实列是基于匈牙利算法和KM算法的二分图匹配.-The actual column is based on Hungarian and KM bipartite graph matching algorithm.
BM
- 经典的单模式匹配算法：BM算法，对特征码检测有特别实用的帮助-The classic single-pattern matching algorithms: BM algorithm, signature detection with the help of special practical
closestPair
- 源程序实现最近匹配算法，从众多点中找到一对举例最近的点。-Look for the closest pair
csm
- 基于PLICP算法实现代码，PLICP是机器人激光扫描数据匹配算法。PLICP算法是ICP算法分支的一个比较高效的算法，当扫描数据中存在不规则图型时，他的鲁棒性和准确性就凸显出来，相对于IDE和COX等ICP分支算法来说。-Based PLICP algorithm code, PLICP robot laser scanning data matching algorithm. PLICP algorithm is a more efficient algorithm ICP algorith
matching
- 提供二分图匹配算法、带权二分图匹配算法、以及HopCroft优化的匹配算法-Provide two graph matching algorithm, weighted two graph matching algorithm, the matching algorithm and HopCroft optimization
kmp
- KMP算法是一种改进的字符串匹配算法,KMP算法的关键是利用匹配失败后的信息，尽量减少模式串与主串的匹配次数以达到快速匹配的目的。-KMP algorithm is an improved string matching algorithm, the key KMP algorithm is the use of information after the match fails, try to reduce the pattern string matching the number of t
dichotomy.tar
- 二分图最佳匹配算法是通过给每个顶点一个标号来把求最大权匹配的问题转化为求完备匹配的问题的-Bipartite graph matching algorithm is optimal for each vertex by a reference to the right to seek the maximum matching problem and minimize the perfect matching problem
SOMP
- 同时正交匹配追踪算法的MATLAB程序，一些文献中也被翻译成同步正交匹配追踪。(Simultaneous Orthogonal Matching Pursuit(SOMP))