A fully linear-time approximation algorithm for grammar-based compression.
Hiroshi SakamotoPublished in: J. Discrete Algorithms (2005)
Keyphrases
- worst case
- learning algorithm
- dynamic programming
- k means
- cost function
- preprocessing
- improved algorithm
- optimization algorithm
- segmentation algorithm
- linear programming
- experimental evaluation
- computational cost
- search space
- optimal solution
- probabilistic model
- high accuracy
- recognition algorithm
- simulated annealing
- approximation methods
- np hard
- significant improvement
- computational complexity
- compressed pattern matching
- neural network
- error tolerance
- polygonal approximation
- image processing
- string matching
- bayesian networks
- data structure
- convergence rate
- closed form
- matching algorithm
- clustering method
- detection algorithm
- computationally efficient
- expectation maximization
- particle swarm optimization
- input data