Sciweavers

1503 search results - page 149 / 301
» Self-optimizing distributed trees
Sort
View
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
15 years 2 months ago
Performance bounds for peer-assisted live streaming
Peer-assisted streaming is a promising way for service providers to offer high-quality IPTV to consumers at reasonable cost. In peerassisted streaming, the peers exchange video ch...
Shao Liu, Rui Zhang-Shen, Wenjie Jiang, Jennifer R...
122
Voted
COMGEO
2004
ACM
15 years 2 months ago
Expected time analysis for Delaunay point location
We consider point location in Delaunay triangulations with the aid of simple data structures. In particular, we analyze methods in which a simple data structure is used to first lo...
Luc Devroye, Christophe Lemaire, Jean-Michel Morea...
114
Voted
TOIS
2002
97views more  TOIS 2002»
15 years 2 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
COLT
2010
Springer
15 years 16 days ago
Forest Density Estimation
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
162
Voted
PPOPP
2011
ACM
14 years 5 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...