Abstract
The storage complexity of the CTW-method is decreased by combining the estimated probability of a node in the context tree and the weighted probabilities of its children in a single ratio.
Original language | English |
---|---|
Title of host publication | Proceedings 1998 IEEE International Symposium on Information Theory |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 347- |
Number of pages | 1 |
ISBN (Print) | 0-7803-5000-6 |
DOIs | |
Publication status | Published - 1998 |
Event | 1998 IEEE International Symposium on Information Theory, ISIT 1998 - Cambridge, United States Duration: 16 Aug 1998 → 21 Aug 1998 |
Conference
Conference | 1998 IEEE International Symposium on Information Theory, ISIT 1998 |
---|---|
Country/Territory | United States |
City | Cambridge |
Period | 16/08/98 → 21/08/98 |
Other | Proc. 1998 IEEE International Symposium on Information Theory, Cambridge, MA, 16-21 August 1998 |