Sciweavers

7 search results - page 1 / 2
» Simple Constructions of Almost k-Wise Independent Random Var...
Sort
View
FOCS
1990
IEEE
13 years 9 months ago
Simple Constructions of Almost k-Wise Independent Random Variables
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
Noga Alon, Oded Goldreich, Johan Håstad, Ren...
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 5 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
JMLR
2010
124views more  JMLR 2010»
12 years 11 months ago
Consistent Nonparametric Tests of Independence
Three simple and explicit procedures for testing the independence of two multi-dimensional random variables are described. Two of the associated test statistics (L1, log-likelihoo...
Arthur Gretton, László Györfi
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 6 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
IJBC
2007
89views more  IJBC 2007»
13 years 4 months ago
Galton's quincunx: Random Walk or Chaos?
In 1873 Francis Galton had constructed a simple mechanical device where a ball is dropped vertically through a harrow of pins that deflect the ball sideways as it falls. Galton c...
Kevin Judd