136 search results - page 3 / 28 » On Learning Monotone Boolean Functions |
159
click to vote
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
141
Voted
ECCC
2010
15 years 5 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
144
click to vote
ECCC
2008
15 years 4 months ago
2008
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
138
Voted
CCCG
2010
15 years 6 months ago
2010
We show how to construct interlocked collections of simple polygons in the plane that fall apart upon removing certain combinations of pieces. Precisely, interiordisjoint simple p...
130
Voted
ISAAC
2004
Springer
15 years 10 months ago
2004
Springer
