Revision as of 09:58, 8 January 2004 edit Eurleif (talk \| contribs) Extended confirmed users 1,044 edits m Made first "Surveys" list item a real list item. ← Previous edit		Revision as of 10:02, 8 January 2004 edit undo APH (talk \| contribs) Extended confirmed users 1,500 edits No edit summary Next edit →
Line 34: * [KV,89] M. Kearns and L. G. Valiant. 1989. Cryptographic limitations on learning boolean formulae and finite automata. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 433--444, New York. ACM. [[Boosting]] * [Sch, 90] Robert E. Schapire. The strength of weak learnability. Machine Learning, 5(2):197--227, 1990

Computational learning theory: Difference between revisions