Sciweavers

473 search results - page 14 / 95
» The Case for Quantum Key Distribution
Sort
View
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 1 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
TIT
2010
150views Education» more  TIT 2010»
13 years 2 months ago
Information-theoretic key agreement of multiple terminals: part I
This is the first part of a two-part paper on information-theoretically secure secret key agreement. In this part, we study the secrecy problem under the widely studied source mod...
Amin Aminzadeh Gohari, Venkat Anantharam
CLADE
2004
IEEE
13 years 11 months ago
Support for Data-Intensive, Variable-Granularity Grid Applications via Distributed File System Virtualization - A Case Study of
A key challenge faced by large-scale, distributed applications in Grid environments is efficient, seamless data management. In particular, for applications that can benefit from a...
Jithendar Paladugula, Ming Zhao 0002, Renato J. O....
FLAIRS
2003
13 years 8 months ago
Distributed Knowledge Representation in Neural-Symbolic Learning Systems: A Case Study
Neural-symbolic integration concerns the integration of symbolic and connectionist systems. Distributed knowledge representation is traditionally seen under a purely symbolic pers...
Artur S. d'Avila Garcez, Luís C. Lamb, Krys...
SAC
2003
ACM
14 years 22 days ago
Are Multiagent Algorithms Relevant for Real Hardware? A Case Study of Distributed Constraint Algorithms
Researchers building multi-agent algorithms typically work with abstracted away from real applications. The abstracted problem instances allow systematic and detailed investigatio...
Paul Scerri, Pragnesh Jay Modi, Wei-Min Shen, Mili...