Reducing the space complexity of a Bayes coding algorithm using an expanded context tree.
Toshiyasu MatsushimaShigeichi HirasawaPublished in: ISIT (2009)
Keyphrases
- space complexity
- worst case
- worst case time complexity
- tree structure
- dynamic programming
- objective function
- learning algorithm
- np hard
- optimal solution
- cost function
- search space
- computational cost
- probabilistic model
- preprocessing
- segmentation algorithm
- pattern matching
- computational complexity
- graph structure
- arc consistency
- minimum spanning tree
- space requirements
- embedded zerotree wavelet