An algorithm for optimal prefix parsing of a noiseless and memoryless channel.
Abraham LempelShimon EvenMartin CohnPublished in: IEEE Trans. Inf. Theory (1973)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- computational complexity
- cost function
- times faster
- computational cost
- neural network
- linear programming
- simulated annealing
- segmentation algorithm
- optimization algorithm
- tree structure
- experimental evaluation
- np hard
- matching algorithm
- convergence rate
- globally optimal
- single pass
- locally optimal
- computationally efficient
- high accuracy
- significant improvement
- k means
- learning algorithm
- particle swarm optimization
- state space
- detection algorithm
- probabilistic model
- association rules
- data structure
- optimal path
- objective function