2695 search results - page 66 / 539 » Learning Graph Matching |
108
click to vote
ENTCS
2007
15 years 2 months ago
2007
Reasoning about graph and model transformation systems is an important means to underpin model-driven software engineering, such as Model-Driven Architecture (MDA) and Model Integ...
124
Voted
SIBGRAPI
2005
IEEE
15 years 7 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
116
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
104
Voted
COCOON
2005
Springer
15 years 7 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
143
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Many traditional methods for shape classification involve
establishing point correspondences between shapes to
produce matching scores, which are in turn used as similarity
meas...