88 search results - page 2 / 18 » Sublinear Algorithms for Parameterized Matching |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
125
click to vote
ICALP
2001
Springer
15 years 1 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
CPM
2005
Springer
15 years 3 months ago
2005
Springer
Two equal length strings, or two equal sized two-dimensional texts, parameterize match (p-match) if there is a one-one mapping (relative to the alphabet) of their characters. Two-...
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
56
Voted
ESA
2004
Springer
15 years 2 months ago
2004
Springer
