{"_id":{"_str":"534279630e946d920a001717"},"__v":1,"authorIDs":[],"author_short":["Long, P. M."],"bibbaseid":"long-anupperboundonthesamplecomplexityofpaclearninghalfspaceswithrespecttotheuniformdistribution-2003","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Philip","M."],"propositions":[],"lastnames":["Long"],"suffixes":[]}],"journal":"Information Processing Letters","number":"5","pages":"229–234","publisher":"Elsevier","title":"An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution","volume":"87","year":"2003","bibtex":"@article{Long2003,\n\tAuthor = {Philip M. Long},\n\tJournal = {Information Processing Letters},\n\tNumber = {5},\n\tPages = {229--234},\n\tPublisher = {Elsevier},\n\tTitle = {An upper bound on the sample complexity of {PAC}-learning halfspaces with respect to the uniform distribution},\n\tVolume = {87},\n\tYear = {2003}\n}\n\n","author_short":["Long, P. M."],"key":"Long2003","id":"Long2003","bibbaseid":"long-anupperboundonthesamplecomplexityofpaclearninghalfspaceswithrespecttotheuniformdistribution-2003","role":"author","urls":{},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www.cs.toronto.edu/cogs/bib/standard-long.bib","downloads":0,"keywords":[],"search_terms":["upper","bound","sample","complexity","pac","learning","halfspaces","respect","uniform","distribution","long"],"title":"An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution","year":2003,"dataSources":["2cjnbEWxd35GBeqEe"]}