A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras.
Yao SunDingkang WangXiaodong MaYang ZhangPublished in: ISSAC (2012)
Keyphrases
- np hard
- numerically stable
- computational complexity
- improved algorithm
- times faster
- k means
- learning algorithm
- objective function
- matching algorithm
- experimental evaluation
- polynomially bounded
- optimization algorithm
- computational cost
- significant improvement
- clustering algorithm
- optimal solution
- expectation maximization
- detection algorithm
- high accuracy
- tree structure
- genetic algorithm
- temporal reasoning
- recognition algorithm
- convergence rate
- preprocessing
- ant colony optimization
- particle swarm optimization
- linear programming
- simulated annealing