Sciweavers

SODA
2012
ACM
208views Algorithms» more  SODA 2012»
13 years 8 months ago
Partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
SODA
2012
ACM
223views Algorithms» more  SODA 2012»
13 years 8 months ago
Data reduction for weighted and outlier-resistant clustering
Statistical data frequently includes outliers; these can distort the results of estimation procedures and optimization problems. For this reason, loss functions which deemphasize ...
Dan Feldman, Leonard J. Schulman
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 8 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 8 months ago
The shifting sands algorithm
We resolve the problem of small-space approximate selection in random-order streams. Specifically, we present an algorithm that reads the n elements of a set in random order and ...
Andrew McGregor, Paul Valiant
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
13 years 8 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko