Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm.
Jean B. LasserreMonique LaurentPhilipp RostalskiPublished in: SAC (2008)
Keyphrases
- learning algorithm
- preprocessing
- improved algorithm
- dynamic programming
- experimental evaluation
- cost function
- high accuracy
- significant improvement
- computational complexity
- computationally efficient
- optimization algorithm
- single pass
- worst case
- data sets
- simulated annealing
- matching algorithm
- segmentation algorithm
- expectation maximization
- recognition algorithm
- times faster
- path planning
- theoretical analysis
- linear programming
- motion estimation
- computational cost
- real life
- k means
- np hard