On the Complexity of Hopcroft's State Minimization Algorithm.
Jean BerstelOlivier CartonPublished in: CIAA (2004)
Keyphrases
- computational complexity
- space complexity
- objective function
- experimental evaluation
- dynamic programming
- times faster
- learning algorithm
- computational cost
- preprocessing
- k means
- theoretical analysis
- optimal solution
- detection algorithm
- matching algorithm
- linear complexity
- high accuracy
- worst case
- motion estimation
- recognition algorithm
- convergence rate
- memory requirements
- search space
- significant improvement
- cost function
- optimization algorithm
- segmentation algorithm
- energy function
- np hard
- linear programming
- simulated annealing
- probabilistic model
- denoising
- decision trees
- data sets