284 search results - page 29 / 57 » Distributed Agreement with Optimal Communication Complexity |
153
click to vote
COCO
2008
Springer
15 years 5 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
133
click to vote
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— The performance of scheduling schemes in multihop wireless networks has attracted significant attention in the recent literature. It is well known that optimal schedul...
141
Voted
SDMW
2004
Springer
15 years 8 months ago
2004
Springer
The recent investigation of privacy-preserving data mining and other kinds of privacy-preserving distributed computation has been motivated by the growing concern about the privacy...
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— In this paper, we propose asynchronous non-orthogonal communication between distributed sensors and a data fusion center via asynchronous direct-sequence code-division ...
146
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—In this paper we study the resource allocation in OFDM-based cognitive radio (CR) networks, under the consideration of many practical limitations such as imperfect spectrum sens...