29908 search results - page 46 / 5982 » On the complexity of communication complexity |
MOBICOM
2006
ACM
14 years 4 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
INFOCOM
2005
IEEE
14 years 3 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
WDAG
1990
Springer
14 years 2 months ago
1990
Springer
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
ICC
2008
IEEE
14 years 4 months ago
2008
IEEE
In this paper, we investigate the low-complexity synchronization design for multi-band orthogonalfrequency-division-multiplexing (MB-OFDM) ultra-wideband (UWB) systems. We propose...
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...