Sciweavers

71 search results - page 2 / 15
» Extracting Randomness from Samplable Distributions
Sort
View
IPL
2006
110views more  IPL 2006»
13 years 4 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
13 years 8 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
14 years 6 months ago
Extracting Objects from the Web
Extracting and integrating object information from the Web is of great significance for Web data management. The existing Web information extraction techniques cannot provide sati...
Zaiqing Nie, Fei Wu, Ji-Rong Wen, Wei-Ying Ma
FOCS
2004
IEEE
13 years 8 months ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson
FOCS
2000
IEEE
13 years 9 months ago
Extracting Randomness via Repeated Condensing
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
Omer Reingold, Ronen Shaltiel, Avi Wigderson