2695 search results - page 295 / 539 » Learning Graph Matching |
126
click to vote
WADS
2005
Springer
15 years 9 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...
110
Voted
CVGIP
2008
15 years 3 months ago
2008
Wang Tiles are constructed from four texture samples, arranged so they can always match a choice of other tiles at two edges. Because they are precomputed, Wang Tiles are a very e...
120
Voted
COMBINATORICS
1999
15 years 3 months ago
1999
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
174
Voted
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
126
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirab...