Individual sequence prediction—upper bounds and application for complexity

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Chamy Allenberg School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel
Published in:
· Proceeding
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Pages 233-242
ACM New York, NY, USA ©1999
table of contents ISBN:1-58113-167-4 doi>10.1145/307400.307446
Individual sequence prediction—upper bounds and application for complexity Published by ACM 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 4
· Downloads (cumulative): 201
· Citation Count: 1


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder