说明：图匹配的RRWM方法。图匹配可用于目标识别，模式识别。
Graph matching RRWM method. Graph matching can be used for object recognition, pattern recognition.
该算法以偶图匹配、回溯技术为数学工具。
This scheduling algorithm takes the bipartite graph matching and the backtracking techniques as mathematical tools.
提出了一种基于图理论的非刚体形状匹配算法。
An algorithm based on graph theory for non-rigid shape matching is presented.
针对目前高校的特点，提出一种偶图匹配和禁忌搜索相结合的排课新算法。
A new algorithm of curriculum schedule based on bipartite-graph matching and Tabu search is proposed to meet the new requirements of the universities.
图割算法是图像立体匹配算法中一种高效的最优化计算方法。
The graph cut algorithm is one of high effective optimal methods in the stereo images matching.
针对环形或链式工程图提出了基于模式分解和符号匹配的特征识别方法。
A feature recognition method for annular or catenary graph was proposed, which is based on decomposition of model and matching of symbol.
在物体识别阶段，将景体与模型的匹配分成三部分进行，即扫描部件、图的匹配部件及匹配检验部件。
In object recognition stage, the approach divides the matching between scene and model into three parts, i. e. the Scanner, the Graph matcher and the Matching Verifier.
给出了一些应用慈善算法进行偶图匹配的重要实验结果，并对慈善算法存在的问题和在超图等研究领域的潜在应用进行了讨论。
Some experimental results for the matching based on charity algorithm are then presented, with open issues and potential applicability in the context of hyper graph left as discussions.
算法采用有向图来表示攻击类别及其逻辑关系，按照前向匹配和缺项匹配的方式对报警进行关联。
In this algorithm, an extended directed graph is used to show attack types and their relations, while the correlation is performed according to the method of forwards matching and absent matching.
在已有文献的基础上，讨论度在图论其它方面，诸如在圈、哈密顿图、匹配中的应用。
This paper discusses the application of degree in other aspects of graph theory, such as cycle, Hamiltonian graph and matching on the base of reference.
基于图割优化的图像密集匹配算法。
The algorithm of dense matching of images based on graph cuts optimization.
称g是偶匹配可扩的，如果G中导出子图是偶图的匹配m都可以扩充为g的完美匹配。
G is said to be bipartite matching extendable (BM-extendable) if every matching m whose induced subgraph is a bipartite graph extends to a perfect matching of g.
结构检索方法建立在图子图匹配算法VF 2的基础上，对其进行了必要的改造和扩展，使之适合于化学结构检索。
The VF2 graph matching algorithm on which the chemical structure search system was based has been modified and extended appropriately.
考虑不同边权重值，利用图匹配策略生成本体匹配图计算相似度。
Weighting the weight to different relations in ontology, and using the method to generate the matching graph.
提出了一种改进的基于二分图完美匹配的布尔匹配算法。
An improved Boolean matching algorithm based on transforming the mapping between Boolean variables into the problem of perfect matching of bipartite graph is presented.
另外考虑本体的关系影响，对不同类型关系引入不同权重生成本体描述矩阵，引入图理论算法生成本体匹配图（MGO）。
And next point is that different relations are assigned different weights, and then the matching graph of ontologys (MGO) is generated by using graph theory.
另外考虑本体的关系影响，对不同类型关系引入不同权重生成本体描述矩阵，引入图理论算法生成本体匹配图（MGO）。
And next point is that different relations are assigned different weights, and then the matching graph of ontologys (MGO) is generated by using graph theory.
应用推荐