28 search results - page 3 / 6 » Learning Random Monotone DNF |
RANDOM
2001
Springer
13 years 9 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
COLT
1992
Springer
13 years 9 months ago
1992
Springer
We consider learning in situations where the function used to classify examples may switch back and forth between a small number of different concepts during the course of learnin...
COLT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. A brief overview is given of recent results on theory revision with queries for propositional formulas, such as monotone and unate DNF, Horn formulas, read-once formulas,...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...
COLT
1993
Springer
13 years 9 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...