278 search results - page 2 / 56 » Algorithmic randomness and monotone complexity on product sp... |
COLT
2001
Springer
13 years 9 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...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
SODA
1992
ACM
13 years 6 months ago
1992
ACM
STOC
2004
ACM
14 years 5 months ago
2004
ACM
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...