1327 search results - page 55 / 266 » Path following algorithm for the graph matching problem |
124
click to vote
COSIT
2003
Springer
15 years 7 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
105
click to vote
WADS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
166
click to vote
ESA
2011
Springer
14 years 1 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...
117
click to vote
CVPR
2009
IEEE
16 years 8 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...
126
click to vote
ACCV
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...