Author:
Natschläger Thomas,Schmitt Michael
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference5 articles.
1. Computational Learning Theory;Anthony,1992
2. Learnability and the Vapnik-Chervonenkis dimension;Blumer;J. ACM,1989
3. A general lower bound on the number of examples needed for learning;Ehrenfeucht;Inform. and Comput.,1989
4. Machine Learning: A Theoretical Approach;Natarajan,1991
5. A theory of the learnable;Valiant;Comm. ACM,1984
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Implementation of Boolean Functions on Content-Addressable Memories;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25
2. On the Implementation of Boolean Functions on Content-Addressable Memories;IEEE Journal on Selected Areas in Information Theory;2023
3. On Alternation, VC-dimension and k-fold Union of Sets;Trends in Mathematics;2021
4. VC Dimension;Encyclopedia of Machine Learning and Data Mining;2017
5. VC Dimension;Encyclopedia of Machine Learning and Data Mining;2016