Slowing down top trees for better worst-case compression.
Bartlomiej DudekPawel GawrychowskiPublished in: Theor. Comput. Sci. (2024)
Keyphrases
- worst case
- wavelet tree
- average case
- upper bound
- lower bound
- image compression
- compression scheme
- np hard
- greedy algorithm
- compression algorithm
- compression ratio
- decision trees
- approximation algorithms
- data compression
- error bounds
- tree structure
- data structure
- neural network
- binary trees
- labeled trees
- worst case analysis
- tree construction
- random access
- website
- data sets
- running times
- arithmetic coding
- compression rate
- mistake bound
- tree automata
- constant factor
- computational complexity
- fractal compression
- worst case scenario
- hyperspectral image compression