Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order.
Stepan KochemazovEduard VatutinOleg ZaikinPublished in: CoRR (2017)
Keyphrases
- learning algorithm
- computational cost
- matching algorithm
- detection algorithm
- optimization algorithm
- optimal solution
- improved algorithm
- times faster
- computational complexity
- preprocessing
- dynamic programming
- high accuracy
- experimental evaluation
- significant improvement
- clustering method
- tree structure
- single pass
- probabilistic model
- worst case
- multi objective
- search space
- objective function
- input image
- particle swarm optimization
- expectation maximization
- computationally efficient
- theoretical analysis
- genetic algorithm
- np hard
- k means
- search algorithm
- support vector
- fixed size