Sciweavers

ALT
2011
Springer
12 years 10 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
ECCC
2002
90views more  ECCC 2002»
13 years 9 months ago
Almost k-wise independence versus k-wise independence
We say that a distribution over {0, 1}n is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. ...
Noga Alon, Oded Goldreich, Yishay Mansour
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
13 years 10 months ago
A probabilistic framework for problems with real structured uncertainty in systems and control
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
Giuseppe Carlo Calafiore, Fabrizio Dabbene
STRINGOLOGY
2008
13 years 11 months ago
On the Uniform Distribution of Strings
In this paper, we propose the definition of a measure for sets of strings of length not greater than a given number. This measure leads to an instanciation of the uniform distribut...
Sébastien Rebecchi, Jean-Michel Jolion
CP
2008
Springer
13 years 12 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
14 years 2 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
FOCS
2000
IEEE
14 years 2 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
COLT
2001
Springer
14 years 2 months ago
On Learning Monotone DNF under Product Distributions
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...
Rocco A. Servedio
CHES
2003
Springer
114views Cryptology» more  CHES 2003»
14 years 3 months ago
True Random Number Generators Secure in a Changing Environment
A true random number generator (TRNG) usually consists of two components: an “unpredictable” source with high entropy, and a randomness extractor — a function which, when app...
Boaz Barak, Ronen Shaltiel, Eran Tromer
FOCS
2006
IEEE
14 years 4 months ago
New Results for Learning Noisy Parities and Halfspaces
We address well-studied problems concerning the learnability of parities and halfspaces in the presence of classification noise. Learning of parities under the uniform distributi...
Vitaly Feldman, Parikshit Gopalan, Subhash Khot, A...