50 search results - page 7 / 10 » On the bit communication complexity of randomized rumor spre... |
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— In this paper, we propose an unequal error protection (UEP) framework for progressive image transmission over wireless networks with both random errors and packet loss....
COCO
2005
Springer
13 years 11 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— In this paper, the performance of a downlink synchronous MC-CDMA system with joint frequency-time domain spreading over time-variant frequency-selective Rayleigh fading...
CIE
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...