Sciweavers

86 search results - page 13 / 18
» soda 2004
Sort
View
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
14 years 7 days ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
14 years 7 days ago
Variable length path coupling
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...
Thomas P. Hayes, Eric Vigoda
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
14 years 7 days ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
14 years 7 days ago
Probabilistic analysis of knapsack core algorithms
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
René Beier, Berthold Vöcking
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
14 years 7 days ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine