Sciweavers

263 search results - page 41 / 53
» Extracting Randomness Using Few Independent Sources
Sort
View
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
14 years 19 days ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
NIPS
2001
13 years 8 months ago
On the Generalization Ability of On-Line Learning Algorithms
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
CCS
2005
ACM
14 years 28 days ago
A model and architecture for pseudo-random generation with applications to /dev/random
We present a formal model and a simple architecture for robust pseudorandom generation that ensures resilience in the face of an observer with partial knowledge/control of the gen...
Boaz Barak, Shai Halevi
STOC
2001
ACM
163views Algorithms» more  STOC 2001»
14 years 7 months ago
Extractor codes
We study error-correcting codes for highly noisy channels. For example, every received signal in the channel may originate from some half of the symbols in the alphabet. Our main c...
Amnon Ta-Shma, David Zuckerman
CAV
2011
Springer
253views Hardware» more  CAV 2011»
12 years 11 months ago
HAMPI: A String Solver for Testing, Analysis and Vulnerability Detection
Abstract. Many automatic testing, analysis, and verification techniques for programs can effectively be reduced to a constraint-generation phase followed by a constraint-solving ...
Vijay Ganesh, Adam Kiezun, Shay Artzi, Philip J. G...