Sciweavers

192 search results - page 39 / 39
» Interplay Between Routing and Distributed Source Coding in W...
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 10 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CORR
2011
Springer
171views Education» more  CORR 2011»
13 years 1 months ago
Design, Implementation and Characterization of a Cooperative Communications System
Cooperative communications is a class of techniques which seek to improve reliability and throughput in wireless systems by pooling the resources of distributed nodes. While coope...
Patrick Murphy, Ashutosh Sabharwal