Sciweavers

136 search results - page 8 / 28
» On Learning Monotone Boolean Functions
Sort
View
STOC
1987
ACM
64views Algorithms» more  STOC 1987»
13 years 11 months ago
On Learning Boolean Functions
B. K. Natarajan
ADCM
2007
104views more  ADCM 2007»
13 years 7 months ago
Shape preserving histogram approximation
We present a new method for reconstructing the density function underlying a given histogram. First we analyze the univariate case taking the approximating function in a class of q...
Paolo Costantini, Francesca Pelosi
ML
1998
ACM
13 years 7 months ago
On Restricted-Focus-of-Attention Learnability of Boolean Functions
In the k-Restricted-Focus-of-Attention (k-RFA) model, only k of the n attributes of each example are revealed to the learner, although the set of visible attributes in each example...
Andreas Birkendorf, Eli Dichterman, Jeffrey C. Jac...
FOCS
2009
IEEE
14 years 2 months ago
KKL, Kruskal-Katona, and Monotone Nets
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
Ryan O'Donnell, Karl Wimmer