A lower bound on compression of unknown alphabets (2005)


Download Links

by Nikola Jevtić , Alon Orlitsky , Narayana P. Santhanam
Venue:Theoret. Comput. Sci
Citations:10 - 3 self

Active Bibliography

34 Universal compression of memoryless sources over unknown alphabets – Alon Orlitsky, Narayana P. Santhanam, Junan Zhang - 2004
3 Universal compression of Markov and related sources over arbitrary alphabets – K. Dhulipala, Alon Orlitsky - 2006
Abstract While deciphering the Enigma Code during World – Alon Orlitsky, Narayana P. Santhanam Junan Zhang, War Ii, I. J. Good, A. M. Turing Considered The
2 Average redundancy for known sources: ubiquitous trees in source coding – W Szpankowski - 2008
1 A Universal Compression Perspective of Smoothing – Nikola Jevtić, Alon Orlitsky
2367 A Decision-Theoretic Generalization of on-Line Learning and an Application to Boosting – Yoav Freund, Robert E. Schapire - 1996
726 A Study of Smoothing Methods for Language Models Applied to Ad Hoc Information Retrieval – Chengxiang Zhai, John Lafferty
538 An Efficient Boosting Algorithm for Combining Preferences – Raj Dharmarajan Iyer , Jr. - 1999
579 Dynamic Bayesian Networks: Representation, Inference and Learning – Kevin Patrick Murphy - 2002