Sciweavers

177 search results - page 20 / 36
» Uniform Hashing in Constant Time and Optimal Space
Sort
View
INFOCOM
2008
IEEE
14 years 1 months ago
BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks
Abstract—In order to improve scalability and reduce maintenance overhead for structured Peer-to-Peer systems, researchers design optimal architectures with constant degree and lo...
Deke Guo, Yunhao Liu, Xiang-Yang Li
STOC
2002
ACM
119views Algorithms» more  STOC 2002»
14 years 7 months ago
Space-efficient approximate Voronoi diagrams
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
Sunil Arya, Theocharis Malamatos, David M. Mount
JACM
2012
11 years 10 months ago
Continuous sampling from distributed streams
A fundamental problem in data management is to draw and maintain a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With la...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 7 months ago
Optimal control theory : a method for the design of wind instruments
It has been asserted previously by the author that optimal control theory can be a valuable framework for theoretical studies about the shape that a wind instrument should have in...
Georges Le Vey
GIS
2005
ACM
14 years 8 months ago
ASPEN: an adaptive spatial peer-to-peer network
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku