Sciweavers

SODA
2008
ACM
95views Algorithms» more  SODA 2008»
13 years 11 months ago
Concatenated codes can achieve list-decoding capacity
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
SODA
2008
ACM
79views Algorithms» more  SODA 2008»
13 years 11 months ago
Algorithms for distributed functional monitoring
Graham Cormode, S. Muthukrishnan, Ke Yi
SODA
2008
ACM
80views Algorithms» more  SODA 2008»
13 years 11 months ago
Designing networks with good equilibria
Ho-Lin Chen, Tim Roughgarden, Gregory Valiant
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
13 years 11 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
SODA
2008
ACM
106views Algorithms» more  SODA 2008»
13 years 11 months ago
Exact and efficient 2D-arrangements of arbitrary algebraic curves
We show how to compute the planar arrangement induced by segments of arbitrary algebraic curves with the Bentley-Ottmann sweep-line algorithm. The necessary geometric primitives r...
Arno Eigenwillig, Michael Kerber
SODA
2008
ACM
92views Algorithms» more  SODA 2008»
13 years 11 months ago
An algorithm for improving graph partitions
Reid Andersen, Kevin J. Lang
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
13 years 11 months ago
Rapid mixing of Gibbs sampling on graphs that are sparse on average
Gibbs sampling also known as Glauber dynamics is a popular technique for sampling high dimensional distributions defined on graphs. Of special interest is the behavior of Gibbs sa...
Elchanan Mossel, Allan Sly
SODA
2008
ACM
123views Algorithms» more  SODA 2008»
13 years 11 months ago
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
Xiaomin Chen, János Pach, Mario Szegedy, G&...
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
13 years 11 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty
SODA
2008
ACM
89views Algorithms» more  SODA 2008»
13 years 11 months ago
Product growth and mixing in finite groups
László Babai, Nikolay Nikolov, L&aac...