Sciweavers

Share
SODA
2008
ACM
92views Algorithms» more  SODA 2008»
9 years 10 months ago
An algorithm for improving graph partitions
Reid Andersen, Kevin J. Lang
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
9 years 10 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»
9 years 10 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»
9 years 10 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»
9 years 10 months ago
Product growth and mixing in finite groups
László Babai, Nikolay Nikolov, L&aac...
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
9 years 10 months ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
9 years 10 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
SODA
2008
ACM
124views Algorithms» more  SODA 2008»
9 years 10 months ago
Competitive queue management for latency sensitive packets
We consider the online problem of non-preemptive queue management. An online sequence of packets arrive, each of which has an associated intrinsic value. Packets can be accepted t...
Amos Fiat, Yishay Mansour, Uri Nadav
books