Title of article :
An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
Author/Authors :
Philip M. Long، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2003
Keywords :
PAC-learning , Halfspaces , computational complexity , Sample complexity , Machine Learning
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters
