118 search results - page 20 / 24 » soda 2008 |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n p...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
100
click to vote
SODA
2008
ACM
14 years 11 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...