A Correction to "An Optimal Algorithm to Compute all the Covers of a String".
Dennis W. G. MooreWilliam F. SmythPublished in: Inf. Process. Lett. (1995)
Keyphrases
- dynamic programming
- worst case
- experimental evaluation
- matching algorithm
- computational complexity
- expectation maximization
- preprocessing
- search space
- theoretical analysis
- cost function
- k means
- optimal solution
- detection algorithm
- space complexity
- segmentation algorithm
- string matching
- times faster
- data sets
- upper bound
- learning algorithm
- high accuracy
- np hard
- significant improvement
- optimization algorithm
- objective function
- pattern matching
- image sequences
- path planning
- closed form
- image segmentation
- exhaustive search
- globally optimal
- suffix tree
- neural network