Convergence and Factor Complexity for the Arnoux-Rauzy-Poincaré Algorithm.
Valérie BerthéSébastien LabbéPublished in: WORDS (2013)
Keyphrases
- computational complexity
- space complexity
- learning algorithm
- worst case
- convergence rate
- preprocessing
- matching algorithm
- high accuracy
- improved algorithm
- iterative algorithms
- computational cost
- segmentation algorithm
- faster convergence
- np hard
- experimental evaluation
- linear complexity
- dynamic programming
- theoretical analysis
- high computational complexity
- cost function
- significant improvement
- optimal solution
- objective function
- convergence property
- simulated annealing
- complexity analysis
- times faster
- clustering method
- input data
- neural network
- genetic algorithm