1664 search results - page 34 / 333 » Distance labeling in graphs |
154
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
134
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
120
click to vote
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
117
click to vote
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Local invariant feature extraction methods are widely used for image-features matching. There exist a number of approaches aimed at the refinement of the matches between image-fe...
119
click to vote
CCCG
2010
15 years 3 months ago
2010
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...