A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic Varieties.
Michael KalkbrenerPublished in: J. Symb. Comput. (1993)
Keyphrases
- experimental evaluation
- dynamic programming
- optimization algorithm
- learning algorithm
- clustering method
- times faster
- search space
- high accuracy
- improved algorithm
- recognition algorithm
- convex hull
- significant improvement
- preprocessing
- k means
- simulated annealing
- selection algorithm
- expectation maximization
- detection algorithm
- cost function
- square grid
- knn
- feature selection
- clustering algorithm
- objective function
- computational complexity
- matching algorithm
- ant colony optimization
- computational cost
- theoretical analysis
- particle filter
- input data
- neural network
- worst case