Sciweavers

511 search results - page 56 / 103
» Lower bounds for distributed markov chain problems
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 8 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
13 years 9 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...
ICASSP
2011
IEEE
12 years 11 months ago
Pilot optimization for time-delay and channel estimation in OFDM systems
Orthogonal frequency division multiplexing (OFDM) communication systems require accurate estimation of timing offset and channel impulse response in order to achieve desirable per...
Michael D. Larsen, Gonzalo Seco-Granados, A. Lee S...
CJ
2010
128views more  CJ 2010»
13 years 8 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...
FOCS
2008
IEEE
14 years 2 months ago
Size Bounds and Query Plans for Relational Joins
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
Albert Atserias, Martin Grohe, Dániel Marx