Sciweavers

140 search results - page 17 / 28
» soda 2010
Sort
View
SODA
2010
ACM
196views Algorithms» more  SODA 2010»
14 years 7 months ago
Streaming Algorithms for extent problems in high dimensions
We develop (single-pass) streaming algorithms for maintaining extent measures of a stream S of n points in Rd . We focus on designing streaming algorithms whose working space is p...
Pankaj K Agarwal, R. Sharathkumar
SODA
2010
ACM
157views Algorithms» more  SODA 2010»
14 years 7 months ago
Testing monotone high-dimensional distributions
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...
Ronitt Rubinfeld, Rocco A. Servedio
SODA
2010
ACM
197views Algorithms» more  SODA 2010»
14 years 7 months ago
Quasirandom Load Balancing
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
14 years 7 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
SODA
2010
ACM
135views Algorithms» more  SODA 2010»
14 years 7 months ago
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
We consider the problem of detecting a vector of symbols that is being transmitted over a fading multiple?input multiple?output (MIMO) channel, where each symbol is an ?th root of...
Anthony Man-Cho So