|
41
|
Asymptotic minimax regret for data compression, gambling and prediction
– Q Xie, A Barron
|
|
28
|
A unified approach to weak universal source coding
– J Kieffer
- 1978
|
|
227
|
Fisher information and stochastic complexity
– J Rissanen
- 1996
|
|
4
|
The Precise Minimax Redundancy
– Michael Drmota , Wojciech Szpankowski
- 2002
|
|
65
|
Universal Portfolios with Side Information
– Thomas M. Cover, Erik Ordentlich
- 1996
|
|
12
|
Smeets, “Multialphabet coding with separate alphabet description
– J ˚Aberg, Y M Shtarkov, B J M
- 1997
|
|
9
|
Universal compression of unknown alphabets
– N Jevtić, A Orlitsky, N Santhanam
|
|
122
|
Universal Portfolios
– Thomas M. Cover
- 1996
|
|
31
|
Always Good Turing: Asymptotically Optimal Probability Estimation
– Alon Orlitsky, Narayana P Santhanam, Junan Zhang
- 2003
|
|
631
|
An Empirical Study of Smoothing Techniques for Language Modeling
– Stanley F. Chen
- 1998
|
|
12
|
Redundancy rates for renewal and other processes
– I Csiszár, P C Shields
- 1996
|
|
91
|
Universal sequential coding of single messages
– Y M Shtarkov
- 1987
|
|
16
|
Universal redundancy rates do not exist
– P Shields
- 1993
|
|
65
|
Universal noiseless coding
– L D Davisson
- 1980
|
|
179
|
Average Case Analysis of Algorithms on Sequences
– W Szpankowski
- 2001
|
|
6
|
A lower bound on compression of unknown alphabets
– Nikola Jevtić, Alon Orlitsky, Narayana P. Santhanam
- 2005
|
|
21
|
Minimax redundancy for the class of memoryless sources
– Q Xie, A R Barron
- 1997
|
|
25
|
The performance of universal coding
– R E Krichevsky, V K Trofimov
- 1981
|
|
1125
|
1968], An Introduction to Probability Theory and
– W Feller
|
