An Algorithm for Computing a Gröbner Basis of a Polynomial Ideal over a Ring with Zero Divisors.
Deepak KapurYongyang CaiPublished in: Math. Comput. Sci. (2009)
Keyphrases
- learning algorithm
- computational complexity
- detection algorithm
- numerically stable
- preprocessing
- k means
- simulated annealing
- worst case
- recognition algorithm
- convergence rate
- experimental evaluation
- dynamic programming
- times faster
- computationally efficient
- search space
- matching algorithm
- classification algorithm
- improved algorithm
- np hard
- optimal solution
- polynomially bounded
- algebraic equations
- high accuracy
- segmentation algorithm
- expectation maximization
- particle swarm optimization
- scheduling problem
- computational cost
- multi objective
- multiscale
- similarity measure