1631 search results - page 6 / 327 » Uniform Distributed Synthesis |
ICDE
1987
IEEE
13 years 11 months ago
1987
IEEE
: Previous multidimensional dynamic hashing schemes exhibit two obvious shortcomings. First, even for uniform record distribution, the retrieval performance of these schemes suffer...
COLT
1999
Springer
13 years 11 months ago
1999
Springer
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
COLT
2003
Springer
14 years 22 days ago
2003
Springer
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
COMBINATORICS
2004
13 years 7 months ago
2004
Let (0, 1), l 2 and let Hn be an l-graph on n vertices. Hn is (, )-uniform if every n vertices of Hn span (
COLT
2008
Springer
13 years 9 months ago
2008
Springer
We show that randomly generated monotone c log(n)-DNF formula can be learned exactly in probabilistic polynomial time. Our notion of randomly generated is with respect to a unifor...