Sciweavers

436 search results - page 4 / 88
» On generalized gossiping and broadcasting
Sort
View
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 7 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...
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 7 months ago
Distributed Successive Approximation Coding using Broadcast Advantage: The Two-Encoder Case
Abstract-- Traditional distributed source coding rarely considers the possible link between separate encoders. However, the broadcast nature of wireless communication in sensor net...
Zichong Chen, Guillermo Barrenetxea, Martin Vetter...
TPDS
2010
98views more  TPDS 2010»
13 years 5 months ago
Minimum Latency Gossiping in Radio Networks
—We studied the minimum latency gossiping (all-to-all broadcast) problem in multihop radio networks defined as follows: Each node in the network is preloaded with a message and t...
Scott C.-H. Huang, Peng-Jun Wan, Hongwei Du, E. K....
FOCS
2002
IEEE
14 years 12 days ago
Protocols and Impossibility Results for Gossip-Based Communication Mechanisms
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...
David Kempe, Jon M. Kleinberg