Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm.
Deepak KapurPublished in: J. Syst. Sci. Complex. (2017)
Keyphrases
- numerically stable
- learning algorithm
- improved algorithm
- significant improvement
- computational complexity
- preprocessing
- times faster
- experimental evaluation
- detection algorithm
- optimization algorithm
- computational cost
- dynamic programming
- cost function
- optimal solution
- probabilistic model
- worst case
- simulated annealing
- linear programming
- computationally efficient
- segmentation algorithm
- objective function
- ant colony optimization
- fixed point
- object detection
- recognition algorithm
- computational efficiency
- matching algorithm
- high accuracy
- data sets
- np hard
- search space
- clustering algorithm
- genetic algorithm