Sciweavers

12 search results - page 3 / 3
» Quantum Lower Bound for Recursive Fourier Sampling
Sort
View
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 5 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...
COLT
2010
Springer
13 years 2 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha