An algorithm for deciding the finiteness of the number of simple permutations in permutation classes.
Frédérique BassinoMathilde BouvelAdeline PierrotDominique RossinPublished in: CoRR (2013)
Keyphrases
- computational complexity
- execution times
- cost function
- preprocessing
- space complexity
- matching algorithm
- times faster
- theoretical analysis
- computational effort
- detection algorithm
- optimization algorithm
- data sets
- np hard
- learning algorithm
- objective function
- segmentation algorithm
- computational cost
- experimental evaluation
- clustering method
- high accuracy
- improved algorithm
- optimal solution
- expectation maximization
- probability distribution
- classification algorithm
- search space
- memory requirements
- convergence rate
- recognition algorithm
- initial set
- linear programming