28357 search results - page 356 / 5672 » Communications |
176
click to vote
STOC
1991
ACM
15 years 10 months ago
1991
ACM
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
185
click to vote
CNSR
2010
IEEE
15 years 9 months ago
2010
IEEE
In the past few years the security issues in the supervisory control and data acquisition (SCADA) system have been investigated, and many security mechanisms have been proposed fro...
169
click to vote
COCO
2008
Springer
2008
Springer
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
15 years 8 months ago
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
158
click to vote
ECSCW
2007
15 years 8 months ago
2007
In computer-mediated group communication, anonymity enables participants to post controversial comments without risking accusations of improper behavior. While this may encourage m...
170
click to vote
OPODIS
2007
15 years 8 months ago
2007
In Sensor Networks, the lack of topology information and the availability of only one communication channel has led research work to the use of randomization to deal with collisio...