A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression.
Hiroshi SakamotoPublished in: CPM (2003)
Keyphrases
- experimental evaluation
- dynamic programming
- optimization algorithm
- computational complexity
- worst case
- closed form
- learning algorithm
- np hard
- cost function
- k means
- simulated annealing
- objective function
- detection algorithm
- recognition algorithm
- improved algorithm
- convex hull
- times faster
- minimum length
- particle swarm optimization
- high accuracy
- computational cost
- matching algorithm
- image compression
- convergence rate
- bitstream
- compression algorithm
- data compression
- preprocessing
- approximation ratio
- similarity measure