Sciweavers

675 search results - page 123 / 135
» Biased Range Trees
Sort
View
TKDE
2010
218views more  TKDE 2010»
14 years 5 months ago
LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
Yuzhe Tang, Shuigeng Zhou, Jianliang Xu
FOCS
2009
IEEE
15 years 5 months ago
Instance-Optimal Geometric Algorithms
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
Peyman Afshani, Jérémy Barbay, Timot...
SIGCOMM
2004
ACM
15 years 4 months ago
A scalable distributed information management system
We present a Scalable Distributed Information Management System (SDIMS) that aggregates information about large-scale networked systems and that can serve as a basic building bloc...
Praveen Yalagandula, Michael Dahlin
ADC
2003
Springer
123views Database» more  ADC 2003»
15 years 4 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
FOCS
2004
IEEE
15 years 2 months ago
On the Streaming Model Augmented with a Sorting Primitive
The need to deal with massive data sets in many practical applications has led to a growing interest in computational models appropriate for large inputs. The most important quali...
Gagan Aggarwal, Mayur Datar, Sridhar Rajagopalan, ...