29908 search results - page 46 / 5982 » On the complexity of communication complexity |
205
click to vote
MOBICOM
2006
ACM
16 years 3 days 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...
170
click to vote
INFOCOM
2005
IEEE
15 years 11 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...
149
click to vote
WDAG
1990
Springer
15 years 10 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...
185
click to vote
ICC
2008
IEEE
16 years 18 days 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...
162
click to vote
CIE
2006
Springer
15 years 10 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...