Avoiding breakdown in the CGS algorithm.
Claude BrezinskiHassane SadokPublished in: Numer. Algorithms (1991)
Keyphrases
- times faster
- detection algorithm
- learning algorithm
- matching algorithm
- experimental evaluation
- optimization algorithm
- theoretical analysis
- np hard
- cost function
- preprocessing
- computational complexity
- improved algorithm
- similarity measure
- selection algorithm
- classification algorithm
- high accuracy
- experimental study
- objective function
- recognition algorithm
- data sets
- tree structure
- single pass
- input data
- probabilistic model
- dynamic programming
- segmentation algorithm
- computationally efficient
- ant colony optimization
- linear programming
- computational cost
- multi objective
- search space
- data structure
- space complexity
- optimal solution