2695 search results - page 40 / 539 » Learning Graph Matching |
120
click to vote
COMBINATORICS
2006
15 years 1 months ago
2006
A set M of edges of a graph G is a matching if no two edges in M are incident to the same vertex. The matching number of G is the maximum cardinality of a matching of G. A set S o...
104
click to vote
ECCV
1998
Springer
16 years 3 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
300
click to vote
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
This paper addresses the problem of simultaneous tracking of multiple targets in a video. We first apply object detectors to every video frame. Pairs of detection responses from ...
107
click to vote
JACM
2010
15 years 11 days ago
2010
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
114
click to vote
CVPR
2004
IEEE
16 years 4 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...