A prolongation-projection algorithm for computing the finite real variety of an ideal.
Jean B. LasserreMonique LaurentPhilipp RostalskiPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- learning algorithm
- dynamic programming
- optimal solution
- detection algorithm
- computational complexity
- worst case
- experimental evaluation
- cost function
- preprocessing
- high accuracy
- simulated annealing
- theoretical analysis
- classification algorithm
- objective function
- times faster
- convex hull
- selection algorithm
- optimization algorithm
- segmentation algorithm
- improved algorithm
- expectation maximization
- data sets
- probabilistic model
- np hard
- k means
- real world
- computational cost
- significant improvement
- search algorithm
- clustering method
- data structure
- reinforcement learning
- similarity measure
- memory requirements
- genetic algorithm