An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.
Frédérique BassinoMathilde BouvelAdeline PierrotDominique RossinPublished in: Adv. Appl. Math. (2015)
Keyphrases
- computational complexity
- space complexity
- dynamic programming
- experimental evaluation
- learning algorithm
- objective function
- matching algorithm
- detection algorithm
- computational effort
- memory requirements
- k means
- np hard
- execution times
- improved algorithm
- optimization algorithm
- significant improvement
- cost function
- genetic algorithm
- image registration
- initial set
- preprocessing
- times faster
- segmentation algorithm
- high accuracy
- small number
- probabilistic model
- theoretical analysis
- search space
- simulated annealing
- support vector
- similarity measure
- undirected graph