Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference13 articles.
1. Abe, N., Polynomial Learnability of Semilinear Sets,Proceedings of the 1989 Workshop on Computational Learning Theory, August, 1989.
2. Angluin, D., Queries for Concept Learning,Machine Learning, 2:319–342, 1987.
3. Blumer, A., Ehrenfeucht, A., Haussler, D., and Warumuth, M.K. Learnability and the Vapnik-Chervonenkis Dimension,Journal of the ACM, 36(4):929–965, October, 1989. e
4. haussler, D., Littlestone, N., and Warumuth, M.K. Predicting {0,1} Functions on Randomly Drawn Points,Proceedings of 1988 IEEE Symposium on the Foundations of Computer Science, 1988.
5. Helmbold, D., Sloan, R., and Warumuth, M.K. Learning Integer Lattices,Proceedings of the 1990 Workshop on Computational Learning Theory, August, 1990.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献