Sciweavers

1434 search results - page 6 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
AAAI
2008
13 years 9 months ago
Expectation-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
Andrew Gilpin, Tuomas Sandholm
FOCS
2009
IEEE
14 years 2 months ago
2-Source Extractors under Computational Assumptions and Cryptography with Defective Randomness
Abstract— We show how to efficiently extract truly random bits from two independent sources of linear min-entropy, under a computational assumption. The assumption we rely on is...
Yael Tauman Kalai, Xin Li, Anup Rao
CSDA
2004
191views more  CSDA 2004»
13 years 7 months ago
Computing the distribution of the product of two continuous random variables
We present an algorithm for computing the probability density function of the product of two independent random variables, along with an implementation of the algorithm in a compu...
Andrew G. Glen, Lawrence Leemis, John H. Drew
FOCS
2009
IEEE
14 years 2 months ago
Extracting Correlations
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...
STOC
1992
ACM
100views Algorithms» more  STOC 1992»
13 years 11 months ago
Biased Random Walks
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Nath...