254 search results - page 24 / 51 » On randomized one-round communication complexity |
ISI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract—Trust is an important yet complex and little understood dyadic relation among actors in a social network. There are many dimensions to trust; trust plays an important ro...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper intro...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract—It may not be feasible for sensor networks monitoring nature and inaccessible geographical regions to include powered sinks with Internet connections. We consider the sc...
TIT
2002
13 years 7 months ago
2002
We recently showed that arbitrarily reliable communication is possible within a single coherence interval in Rayleigh flat fading as the symbol-duration of the coherence interval ...
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...