Sciweavers

1923 search results - page 373 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
CPHYSICS
2007
71views more  CPHYSICS 2007»
13 years 7 months ago
Simulation of n-qubit quantum systems. III. Quantum operations
During the last decade, several quantum information protocols, such as quantum key distribution, teleportation or quantum computation, have attracted a lot of interest. Despite th...
T. Radtke, S. Fritzsche
SPAA
2009
ACM
14 years 4 months ago
At-most-once semantics in asynchronous shared memory
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...
ACSC
2005
IEEE
14 years 1 months ago
A Two-Pronged Attack on the Dragon of Intractability
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
Stephen Gilmour, Mark Dras
COLT
2006
Springer
13 years 11 months ago
Efficient Learning Algorithms Yield Circuit Lower Bounds
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
Lance Fortnow, Adam R. Klivans
NSDI
2010
13 years 8 months ago
Centrifuge: Integrated Lease Management and Partitioning for Cloud Services
: Making cloud services responsive is critical to providing a compelling user experience. Many largescale sites, including LinkedIn, Digg and Facebook, address this need by deployi...
Atul Adya, John Dunagan, Alec Wolman