254 search results - page 16 / 51 » On randomized one-round communication complexity |
120
click to vote
MOBICOM
2003
ACM
15 years 5 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...
131
click to vote
SIAMCOMP
2010
14 years 6 months ago
2010
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We consider the multiple-access communication problem in a distributed setting for both the additive white Gaussian noise channel and the discrete memoryless channel. We propose a ...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper we consider the problem of semiblind carrier frequency offset (CFO) estimation for OFDM systems. Specifically, we consider a synchronization scheme based on the ...
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...