2695 search results - page 101 / 539 » Learning Graph Matching |
108
click to vote
SODA
1997
ACM
15 years 3 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
114
Voted
COMBINATORICA
2010
14 years 9 months ago
2010
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we charact...
103
click to vote
CVPR
2006
IEEE
15 years 8 months ago
2006
IEEE
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inf...
173
click to vote
ESA
2011
Springer
14 years 2 months ago
2011
Springer
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
157
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
In this paper we study interest point descriptors for image matching and 3D reconstruction. We examine the building blocks of descriptor algorithms and evaluate numerous combinati...