Author:
Helmbold David P.,Long Philip M.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference24 articles.
1. M. Anthony, N. Biggs, and J. Shawe-Taylor, (1990). The learnability of formal concepts.The 1990 Workshop on Computational Learning Theory, 246?257.
2. D. Angluin and L. Valiant, (1979). Fast probabilistic algorithms for Hamiltonion circuits and matchings.Journal of Computer and System Sciences, 18(2):155?193.
3. D. Aldous and U. Vazirani, (1990). A Markovian extension of Valiant's learning model.Proceedings of the 31st Annual Symposium on the Foundations of Computer Science, pages 392?396.
4. N. Abe and O. Watanabe, (1992). Polynomially sparse variations and reducibility among prediction problems.IEICE Trans. Inf. & Syst., E75-D(4):449?458, 1992.
5. A. Blumer, A. Ehrenfeucht, D. Haussler, and M.K. Warmuth, (1989). Learnability and the Vapnik-Chervonenkis dimension.JACM, 36(4):929?965.
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献