Y. Sakai and A. Maruoka. Learning monotone log-term DNF formulas under the uniform distribution. Theory of Computing Systems, 33:17-33, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Learning DNF in Time ... - Klivans, Servedio (2001) (1 citation) (Correct)
....in his seminal 1984 paper introducing the PAC learning model [37] more than fteen years later this question is widely regarded as one of the most important open problems in learning theory. While many partial results have been given for restricted versions of the DNF learning problem (see e.g. [8, 9, 21, 23, 24, 26, 27, 33, 38, 39]) the diculty of the unrestricted DNF learning problem is evidenced by the fact that, prior to the current work, only two algorithms were known which improve on the naive 2 n time bound [11, 36] The rst subexponential time algorithm for learning DNF was due to Bshouty [11] who gave an ....
Y. Sakai and A. Maruoka. Learning monotone log-term DNF formulas under the uniform distribution. Theory Comput. Systems 33 (2000), 17-33.
Learning DNF in Time ... - Klivans, Servedio (2001) (1 citation) (Correct)
....in his seminal 1984 paper introducing the PAC learning model [36] more than fifteen years later this question is widely regarded as one of the most important open problems in learning theory. While many partial results have been given for restricted versions of the DNF learning problem (see e.g. [8, 9, 21, 23, 24, 26, 27, 32, 37, 38]) the difficulty of the unrestricted DNF learning problem is evidenced by the fact that, prior to the current work, only two algorithms were known which improve on the naive 2 n time bound [11, 35] The first subexponential time algorithm for learning DNF was due to Bshouty [11] who gave an ....
Y. Sakai and A. Maruoka. Learning monotone log-term DNF formulas under the uniform distribution. Theory Comput. Systems 33 (2000), 17-33.
Learning Intersections and Thresholds of Halfspaces - Klivans, O'Donnell, Servedio (2002) (2 citations) (Correct)
No context found.
Y. Sakai and A. Maruoka. Learning monotone log-term DNF formulas under the uniform distribution. Theory of Computing Systems, 33:17-33, 2000.
Learning DNF from Random Walks - Bshouty, Mossel, O'Donnell, Servedio (2003) (4 citations) (Correct)
No context found.
Y. Sakai and A. Maruoka. Learning monotone log-term DNF formulas under the uniform distribution. Theory of Computing Systems, 33:17--33, 2000.
Maximum Margin Algorithms with Boolean Kernels - Khardon, Servedio (Correct)
No context found.
Y. Sakai and A. Maruoka. Learning monotone log-term DNF formulas under the uniform distribution. Theory of Computing Systems, 33:17-33, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC