4616 search results - page 384 / 924 » The Communication Complexity of Correlation |
212
click to vote
EUROCRYPT
2000
Springer
15 years 11 months ago
2000
Springer
We show that general one-way trapdoor permutations are sufficient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n....
235
click to vote
COCO
2008
Springer
15 years 9 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 ...
239
click to vote
FPL
2008
Springer
15 years 9 months ago
2008
Springer
Cryptanalysis of symmetric and asymmetric ciphers is a challenging task due to the enormous amount of involved computations. To tackle this computational complexity, usually the e...
197
click to vote
AI
1999
Springer
15 years 7 months ago
1999
Springer
While terminology and some concepts of behavior-based robotics have become widespread, the central ideas are often lost as researchers try to scale behavior to higher levels of co...
231
click to vote
GLOBECOM
2009
IEEE
15 years 5 months ago
2009
IEEE
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...