Sciweavers

SODA
2012
ACM
206views Algorithms» more  SODA 2012»
11 years 11 months ago
LSH-preserving functions and their applications
Flavio Chierichetti, Ravi Kumar
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
11 years 11 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
SODA
2012
ACM
183views Algorithms» more  SODA 2012»
11 years 11 months ago
Information dissemination via random walks in d-dimensional space
Henry Lam, Zhenming Liu, Michael Mitzenmacher, Xia...
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
11 years 11 months ago
Global minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...
Jeff Erickson, Kyle Fox, Amir Nayyeri
SODA
2012
ACM
210views Algorithms» more  SODA 2012»
11 years 11 months ago
Approximation algorithms and hardness of the k-route cut problem
Julia Chuzhoy, Yury Makarychev, Aravindan Vijayara...
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 11 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»
11 years 11 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»
11 years 11 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»
11 years 11 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»
11 years 11 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