1632 search results - page 21 / 327 » Sublinear Time Algorithms for Metric Space Problems |
148
click to vote
JCSS
2002
15 years 2 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
147
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
157
Voted
CORR
2010
Springer
15 years 20 days ago
2010
Springer
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
108
click to vote
CPM
2004
Springer
15 years 7 months ago
2004
Springer
The problem of comparing two sequences A and B to determine their similarity is one of the fundamental problems in pattern matching. A challenging, basic variation of the sequence...
138
click to vote
IJCV
2002
15 years 2 months ago
2002
Abstract. A new, exemplar-based, probabilistic paradigm for visual tracking is presented. Probabilistic mechanisms are attractive because they handle fusion of information, especia...