Sciweavers

SODA
2012
ACM
196views Algorithms» more  SODA 2012»
13 years 7 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
SODA
2012
ACM
208views Algorithms» more  SODA 2012»
13 years 7 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 7 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 7 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
172
Voted
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 7 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 7 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
SODA
2012
ACM
224views Algorithms» more  SODA 2012»
13 years 7 months ago
Algorithms for the transportation problem in geometric settings
R. Sharathkumar, Pankaj K. Agarwal
SODA
2012
ACM
218views Algorithms» more  SODA 2012»
13 years 7 months ago
Linear kernels for (connected) dominating set on H-minor-free graphs
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
SODA
2012
ACM
185views Algorithms» more  SODA 2012»
13 years 7 months ago
On a linear program for minimum-weight triangulation
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...
Arman Yousefi, Neal E. Young
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
13 years 7 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky