1056 search results - page 21 / 212 » Constraint-Based Graph Matching |
106
Voted
MOR
2007
14 years 12 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
89
Voted
MLG
2007
Springer
15 years 6 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
118
click to vote
ECCV
2004
Springer
16 years 2 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
126
Voted
FLAIRS
2006
15 years 1 months ago
2006
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
108
Voted
CORR
2008
Springer
15 years 15 days ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...