Opening book details…
About this Computer Science article
An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution by Philip M. Long is a Computer Science article available to read on EtoBox.
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Philip M. Long
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0020-0190)
- Published
- 2003
- Language
- EN
- Field
- Computer Science (Physical Sciences)