搜索资源列表
2771
- poj 2771 一道关于二分图的最大匹配-poj 2771 on the maximum bipartite graph matching
1469
- poj 1469 COURSES 二分图的最大匹配问题 -poj 1469 COURSES largest bipartite graph matching problem
fenci
- PHP 织梦逆向最大匹配算法 中文分词 分词算法-PHP DedeCms reverse maximum matching algorithm for Chinese word segmentation algorithm
KMP
- 给定两个串S和T，长分别m和n，算法给出了一个找出二串间最大匹配的算法。该算法可用于比较两个串S和T的相似程度。-Given two strings S and T, respectively m and n, an algorithm to find the second largest string matching algorithms. The algorithm can be used to compare two strings S and T the degree of simil
KSeg4J.1.0
- 简体中文机械分词模块，实现正逆向最大匹配消除歧义，jar封装，可以导入后直接使用-a simplified Chinese segmentation Jar
poj1469
- poj1469, 二分图最大匹配，最大匹配-poj1469, Maximum Bipartite Matching
zoj1525Airraid
- zoj1525, 最小路径覆盖, 最大匹配-zoj1525, minimum path cover
20090224171138551
- 主要内容： 匹配的概念 二分图的定义和判定 二分图的最大匹配 二分图的最小覆盖问题 二分图的最佳匹配问题 -Main elements: the concept of matching the definition of bipartite graph and determine the maximum bipartite graph matching bipartite graph of minimum coverage of bipartite graph match
code2
- 基于map的正向最大匹配与逆向最大匹配算法的浅分析 中文信息处理 源码 报告-Map-based forward and reverse maximum matching algorithm for maximum matching shallow analysis of Chinese information processing source reports
musicanalysis
- 分析一段音乐的音调 确定策略有点简单 大家可以改 比如改为最大匹配的就行 试一下了 -Analysis of a musical tone a little bit simple and we can identify strategies to change such as the biggest match on the line instead to try the
erbutu
- 二部图的计算,判定二部图,最大匹配,计算最大匹配-describe erbutu
KMPandmax_match
- 1,KMP:实现了在一个字符串中查找字串的高效算法，复杂度为O（m+n） 2，max_match：求两个字符串的最大匹配字串 在vc6.0中调试通过，可以使用-1, KMP: realized in a string to find String efficient algorithm complexity is O (m+ n) 2, max_match: seeking two strings maximum matching string in the vc6.0 debug en
Lucene
- Lucene的基于正向最大匹配分析器,用于中文分词，可将查准率提高-Lucene chinese analyzer based by FMM algorithm
FastStereoMatchingUsingRectangularSubregioningand3
- 本文提出了一种快速，可靠的立体匹配算法产生浓密视差图，通过使用快速互相关、矩形秩和3D最大表面技术粗到细计划。-This paper presents a fast and reliable stereo matching algorithm which produces a dense disparity map by using fast cross correlation, rectangular subregioning (RSR) and 3D maximum-surfac
segment
- 基于n元语法的分词。先训练后，再通过前后向最大匹配初步分词，在通过2元语法来消岐。-Based on the n-gram sub-word. The first training and then through to the maximum matching before and after the initial word, in through a 2-gram to eliminate qi.
acm-pku1466
- 二分图的最大匹配之匈牙利算法详解，以前做ACM时写的，仅供参考，另外提供了一个北大题目的源程序作为实现实例-data structure--graph
The_flow_and_the_maximal_matching1
- 关于最大流问题，与最大匹配的讲解。内容比较浅显易懂。-On the maximum flow problem, with the largest matching explained. The study were easy to understand.
longest
- 数据结构中，发现两个字符串中最大匹配的字符的相关程序-Data structure, we found two strings of characters in the biggest match of the relevant procedures
pipeilvbo
- 匹配滤波器的实现。主要是通过fft变化使输出自相关最大，在通过滤波器。-Matched filter implementation. Mainly through changes in the output autocorrelation fft the largest through the filter.
matchfilter
- 雷达信号处理中的匹配滤波器设计，实现最大信噪比输出-Radar signal processing in the matched filter designed for maximum signal to noise ratio output