COMPLEXITY REDUCING TECHNIQUES FOR THE CTW ALGORITHM
Volf, P.A.J., F.M.J. Willems, T.J. Tjalkens, A. Barbé, Meulen, van der, E., P. Vanroose · TU/e Research Portal · 1999
In [3] Willems, Shtarkov and Tjalkens presented the context-tree weighting algorithm (CTW algorithm). Since then it has been the topic for many re-search projects. In [5] a first step towards a practical implementation has been made. This paper discusses several other implementation details con-cerning the CTW algorithm. The computational work has been improved, the memory requirements have been significantly reduced, and finally, a construction of a forward decomposition [2] is presented that reduces the complexity further, while it improves the performance at the same time.