136 search results - page 5 / 28 » On Learning Monotone Boolean Functions |
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
SIAMCOMP
2000
13 years 7 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
DM
2006
13 years 7 months ago
2006
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
TBILLC
2005
Springer
14 years 1 months ago
2005
Springer
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deï...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We study the average number of well-chosen labeled examples that are required for a helpful teacher to uniquely specify a target function within a concept class. This "average...