Sciweavers

27 search results - page 5 / 6
» Extractors Using Hardness Amplification
Sort
View
ECCC
1998
105views more  ECCC 1998»
13 years 5 months ago
Pseudorandom generators without the XOR Lemma
Impagliazzo and Wigderson IW97] have recently shown that if there exists a decision problem solvable in time 2O(n) and having circuit complexity 2 (n) (for all but nitely many n) ...
Madhu Sudan, Luca Trevisan, Salil P. Vadhan
APPROX
2005
Springer
79views Algorithms» more  APPROX 2005»
13 years 11 months ago
Reconstructive Dispersers and Hitting Set Generators
Abstract. We give a generic construction of an optimal hitting set generator (HSG) from any good “reconstructive” disperser. Past constructions of optimal HSGs have been based ...
Christopher Umans
ICS
2010
Tsinghua U.
13 years 9 months ago
Weight Distribution and List-Decoding Size of Reed-Muller Codes
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
Tali Kaufman, Shachar Lovett, Ely Porat
BMCBI
2011
12 years 9 months ago
Wavelet-based identification of DNA focal genomic aberrations from single nucleotide polymorphism arrays
Background: Copy number aberrations (CNAs) are an important molecular signature in cancer initiation, development, and progression. However, these aberrations span a wide range of...
Youngmi Hur, Hyunju Lee
APPROX
2009
Springer
85views Algorithms» more  APPROX 2009»
13 years 12 months ago
Pseudorandom Generators and Typically-Correct Derandomization
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
Jeff Kinne, Dieter van Melkebeek, Ronen Shaltiel