851 search results - page 75 / 171 » Random constructions and density results |
132
click to vote
ECCC
2011
14 years 10 months ago
2011
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
143
click to vote
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
Earth Mover Distance (EMD) is a popular distance to compute distances between Probability Density Functions (PDFs). It has been successfully applied in a wide selection of problem...
120
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We show that for k ≥ 3 even the Ω(n) level of the Lasserre hierarchy cannot disprove a random k-CSP instance over any predicate type implied by k-XOR constraints, for example ...
119
Voted
CC
2007
Springer
15 years 3 months ago
2007
Springer
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
117
click to vote
COCO
2001
Springer
15 years 8 months ago
2001
Springer
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...