- 更多网络例句与最大匹配相关的网络例句 [注：此内容来源于网络，仅供参考]
-
That shows us to be in will study Baidu is participial algorithm, carry development of a few years, it is quite mature that the participial algorithm of Baidu has been been, this among them little also not the contribution of SEOER, the elder that has a SEOER has said: Yu magpie is サ of horsefly of Zhui ㄓ bits to flinch ? of lax Congyong model surnames ? of clear of ヅ of earnest of ? clam the She nationality americium of ? of clear of ヅ of earnest of the She nationality of clam of ? of ? of clear of ヅ of earnest of the She nationality of acute hearing clam reads fat of evade of Tuan of ?
那现我们在来研究一下百度是分词算法，通过几年的发展，百度的分词算法已经算是相当成熟了，这其中也少不了SEOER 的功劳，有一位SEOER的前辈说过：百度的算法有简单的有复杂的，有正向最大匹配，反向最大匹配，双向最大匹配，语言模型方法，最短路径算法等等，有爱好的可以用GOOGLE去搜索一下以增加理解。
-
The arithmetic of incidence matrix is an arithmetic obtained by studying adjacency matrix and the relationship of tree and incidence matrix to get an new arithmetic of finding the maximum matching of tree.
通过邻接矩阵的方法得到一种去边法求树的最大匹配的算法；并通过图与其关联矩阵的关系，寻找到求树的最大匹配的一个新算法，称为关联矩阵法。
-
Arbitrary map of the maximum matching algorithm, it is worth a study.
任意图的最大匹配算法，值得一学。
-
To choose the information sources, an access point selection method proposed by the thesis, that is, the maximum matching method is used.
在选择信息源时，还采用了本文所提出的一种接入点选择和匹配方法——最大匹配法。
-
Finally, we study the structure of the maximum matching graphs and give an algorithm for constructing the maximum matching graphs on bigraphs.
最后深入研究了二部图最大匹配图的结构性质并给出了构造二部图的最大匹配图的一种算法。
-
The whole module based on the most popular architecture Lucene,and implement the Maximum Matching Algorithm with the ability of eliminate different meanings.
整个模块基于当前最流行的搜索引擎架构Lucene，实现了带有歧义消除功能的正向最大匹配算法。
-
A new dictionary structure which fits for the method of Maximum Matching in Chinese segmentation and an algorithm of an improving method of MM are given.
本文还给出了一种新的、适合汉语最大匹配法分词用的词典结构：局部逆序的以领头字为关键字的一级索引词典结构，以及与该词典相配套的最大匹配法的改进算法，并揭示出词典结构与分词的关系。
-
To solve the problem of automatic word extraction which is the basis of Chinese information processing, this paper presents two new methods——reverse maximum matching and frequency statistics and bidirectional maximum matching and frequency statistics.
针对作为中文信息处理基础的抽词问题，本文在作者提出的正向串频最大匹配法的基础上，提出了逆向串频最大匹配法及双向串频最大匹配法。
-
Bipartite matching is adopted to adjust the relations between the constraint equations and variables, and then the matching result is mapped to a data structure named Engineering Constraint Graph. A solving sequence is achieved by topology sort and strong connected component condensation of ECG.
先使用二分图最大匹配调整约束方程与自变量之间的匹配关系，然后将匹配结果映射为工程约束图，通过对工程约束图进行强连通分量凝聚和拓扑排序，得到求解序列。
-
In practice, if the current string is shorter than the previous one or if the matching length is longer than the farmost index distance or if it's the best matching, searching operation is ended.
在实际中，终止寻找匹配应符合：当前匹配长度小于前一匹配长度，超过最远索引距离，达到最大匹配等3个条件。
- 更多网络解释与最大匹配相关的网络解释 [注：此内容来源于网络，仅供参考]
-
bipartite graph：二部图
2.Push-Relabel算法 (TBC)2.二部图(Bipartite Graph)最大匹配割(Cut)将流网络的点集分为两个部分,一部分包含s,另一部分包含t. 两个集合没有交集. 抱着无所谓的态度, 我总算是完成了20分钟的演讲, 一切还算比较顺利吧, 虽然问题回答得不太好.
-
maximal tree：最大树
最大匹配问题|maximum matching problem | 最大树|maximal tree | 最大似然估计|maximum likelihood estimate, MLE
-
maximum material condition：最大实体条件
maximum matching 极大匹配 | maximum material condition 最大实体条件 | maximum material principle 最大实体原则
-
maximum matching：最大匹配
基于字符串的最大匹配,这种方法现在仍比较常用,最大匹配(Maximum Matching)分为正向和逆向两种最大匹配,正向匹配的基本思想是:假设词典中最大词条所含的汉字个数为n个,取待处理字符串的前n个字作为匹配字段,查找分词词典.
-
maximum matching：极大匹配
maximum likelihood principle 极大似然法 | maximum matching 极大匹配 | maximum modulus principle 最大模原理
-
maximum matching problem：最大匹配问题
最大模定理|maximum modulus theorem | 最大匹配问题|maximum matching problem | 最大树|maximal tree
-
Maximum Requirement Matching：极大匹配
归一化:maximum voluntary contraction | 极大匹配:Maximum Requirement Matching | 最大转矩:maximum torque
-
maximum modulus principle：最大模原理
maximum matching 极大匹配 | maximum modulus principle 最大模原理 | maximum number 最大数
-
perfect matching：完美匹配
最多边的匹配.匹配数(matching number)是最大匹配的大小.完美匹配(perfect matching)是匹配了所有点的匹配.完备匹配(complete matching)是匹配了二分图较小部份的所有点的匹配.从若干可能的安排或方案中寻求某种意义下的最优安排或方案,
-
Unscrambling Images：模拟置换即可
1157 Triangle War 博弈搜索 | 1158 Unscrambling Images 模拟置换即可 | 1159 A Plug for UNIX 经典二分图最大匹配