1414 search results - page 12 / 283 » Randomness and Universal Machines |
MST
2006
13 years 8 months ago
2006
We investigate the characterizations of effective randomness in terms of Martin-L
COLT
2001
Springer
14 years 1 months ago
2001
Springer
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...
SOFSEM
2009
Springer
14 years 5 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
SIAMJO
2008
13 years 8 months ago
2008
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
IPL
2008
13 years 8 months ago
2008
In order to generate a universal probability distribution to extrapolate a binary string x of length i, we feed random bits into a universal device, M. When we find an input strin...