Sciweavers

71 search results - page 1 / 15
» Extracting Randomness from Samplable Distributions
Sort
View
FOCS
2000
IEEE
13 years 9 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
ECCC
2011
183views ECommerce» more  ECCC 2011»
12 years 11 months ago
Extractors and Lower Bounds for Locally Samplable Sources
We consider the problem of extracting randomness from sources that are efficiently samplable, in the sense that each output bit of the sampler only depends on some small number d ...
Anindya De, Thomas Watson
FSTTCS
2009
Springer
13 years 11 months ago
Kolmogorov Complexity in Randomness Extraction
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
John M. Hitchcock, Aduri Pavan, N. V. Vinodchandra...
FOCS
2007
IEEE
13 years 11 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat
SIGIR
2009
ACM
13 years 11 months ago
Extracting structured information from user queries with semi-supervised conditional random fields
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
Xiao Li, Ye-Yi Wang, Alex Acero