1632 search results - page 7 / 327 » Sublinear Time Algorithms for Metric Space Problems |
112
Voted
RSA
2006
15 years 4 months ago
2006
The k
160
click to vote
CACM
2010
15 years 3 months ago
2010
As it becomes increasingly viable to capture, store, and share large amounts of image and video data, automatic image analysis is crucial to managing visual information. Many prob...
137
Voted
SIROCCO
2004
15 years 6 months ago
2004
In this paper we study the range assignment problem in static ad-hoc networks on metric spaces. We consider the h-strong connectivity and h-broadcast problems on trees, high dimens...
158
Voted
SODA
2004
ACM
15 years 6 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
127
Voted
WEA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...