Sciweavers

1632 search results - page 7 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
CACM
2010
161views more  CACM 2010»
14 years 7 months ago
Efficiently searching for similar images
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...
Kristen Grauman
SIROCCO
2004
14 years 11 months ago
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces
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...
Deshi Ye, Hu Zhang
SODA
2004
ACM
161views Algorithms» more  SODA 2004»
14 years 11 months ago
Approximation schemes for Metric Bisection and partitioning
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...
Wenceslas Fernandez de la Vega, Marek Karpinski, C...
WEA
2005
Springer
97views Algorithms» more  WEA 2005»
15 years 3 months ago
Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces
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...
Domenico Cantone, Alfredo Ferro, Rosalba Giugno, G...