Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals.
A. I. ZobninPublished in: Program. Comput. Softw. (2010)
Keyphrases
- numerically stable
- learning algorithm
- objective function
- improved algorithm
- cost function
- experimental evaluation
- expectation maximization
- computational complexity
- times faster
- k means
- significant improvement
- np hard
- input data
- probabilistic model
- detection algorithm
- particle swarm optimization
- computational cost
- search algorithm
- image processing
- simulated annealing
- worst case
- scheduling problem
- optimization algorithm
- dynamic programming
- association rules
- algebraic equations