SIGN IN
SIGN UP
Noise-tolerant learning near the information-theoretic bound
Full Text:
PDF
Buy this Article
Authors:
Nicolò Cesa-Bianchi
DSI, Università di Milano, Via Comelico 39, 1-20135 Milano, Italy
Eli Dichterman
Department of Computer Science, Technion, Haifa 32000, Israel
Paul Fischer
Lehrstuhl Informatik II, Universität Dortmund, D-44221 Dortmund, Germany
Hans Ulrich Simon
Lehrstuhl Informatik II, Universität Dortmund, D-44221 Dortmund, Germany
1996 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 5
· Downloads (cumulative): 168
· Citation Count: 1
Published in:
· Proceeding
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Pages 141-150
ACM
New York, NY
, USA
©1996
table of contents
ISBN:0-89791-785-5
doi>
10.1145/237814.237849
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
information theory
learning
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder