Sciweavers

6393 search results - page 324 / 1279
» Randomized Algorithms on the Mesh
Sort
View
FOCS
2000
IEEE
15 years 11 months ago
The Randomness Recycler: A New Technique for Perfect Sampling
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
James Allen Fill, Mark Huber
CRYPTO
2012
Springer
222views Cryptology» more  CRYPTO 2012»
13 years 9 months ago
Secure Identity-Based Encryption in the Quantum Random Oracle Model
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
Mark Zhandry
BERTINORO
2005
Springer
16 years 6 days ago
Design and Analysis of a Bio-inspired Search Algorithm for Peer to Peer Networks
Decentralized peer to peer (p2p) networks like Gnutella are attractive for certain applications because they require no centralized directories and no precise control over network ...
Niloy Ganguly, Lutz Brusch, Andreas Deutsch
AIMSA
2008
Springer
16 years 1 months ago
Incorporating Learning in Grid-Based Randomized SAT Solving
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 8 months ago
Typical random 3-SAT formulae and the satisfiability threshold
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...
Olivier Dubois, Yacine Boufkhad, Jacques Mandler