On the Average Complexity of Moore's State Minimization Algorithm
Frédérique BassinoJulien DavidCyril NicaudPublished in: CoRR (2009)
Keyphrases
- computational complexity
- objective function
- learning algorithm
- experimental evaluation
- detection algorithm
- worst case
- k means
- high accuracy
- significant improvement
- space complexity
- optimization algorithm
- dynamic programming
- computational cost
- probabilistic model
- input data
- memory requirements
- segmentation algorithm
- improved algorithm
- complexity analysis
- high computational complexity
- times faster
- linear programming
- computationally efficient
- preprocessing
- particle swarm optimization
- standard deviation
- recognition algorithm
- motion estimation
- cost function
- optimal solution
- global minimization