1056 search results - page 62 / 212 » Constraint-Based Graph Matching |
ICPR
2006
IEEE
16 years 1 months ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....
111
Voted
ICCV
2007
IEEE
15 years 6 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
99
Voted
COMBINATORICS
2007
15 years 16 days ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
106
click to vote
PPAM
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
120
click to vote
ALGORITHMICA
2008
15 years 20 days ago
2008
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...