Pages that link to "Item:Q1112787"
From MaRDI portal
The following pages link to Universal sequential coding of single messages (Q1112787):
Displaying 6 items.
- Predicting a binary sequence almost as well as the optimal biased coin (Q1398365) (← links)
- Relative expected instantaneous loss bounds (Q1604219) (← links)
- A lower bound on compression of unknown alphabets (Q1770393) (← links)
- Adaptive game playing using multiplicative weights (Q1818286) (← links)
- Statistical Problem Classes and Their Links to Information Theory (Q5080449) (← links)
- Number of hidden states and memory: a joint order estimation problem for Markov chains with Markov regime (Q5851010) (← links)