Sciweavers

24421 search results - page 61 / 4885
» Communicating Complex Systems
Sort
View
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
11 years 10 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
DEBS
2010
ACM
13 years 11 months ago
Reliable complex event detection for pervasive computing
Complex event processing for pervasive computing must deal with various sources of error. In this paper, we focus on improving complex event detector handling of several types of ...
Dan O'Keeffe, Jean Bacon
COCO
2007
Springer
108views Algorithms» more  COCO 2007»
14 years 1 months ago
The Communication Complexity of Correlation
We examine the communication required for generating random variables remotely. One party Alice will be given a distribution D, and she has to send a message to Bob, who is then r...
Prahladh Harsha, Rahul Jain, David A. McAllester, ...
ICALP
2007
Springer
14 years 1 months ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...