An Algorithm for Computing Standard Bases by Change of Ordering via Algebraic Local Cohomology.
Katsusuke NabeshimaShinichi TajimaPublished in: ICMS (2014)
Keyphrases
- objective function
- estimation algorithm
- times faster
- computational cost
- improved algorithm
- theoretical analysis
- k means
- simulated annealing
- learning algorithm
- high accuracy
- probabilistic model
- search space
- experimental evaluation
- optimal solution
- detection algorithm
- expectation maximization
- dynamic programming
- recognition algorithm
- preprocessing
- segmentation algorithm
- particle swarm optimization
- linear programming
- significant improvement
- worst case
- maximum likelihood
- evolutionary algorithm
- matching algorithm
- path planning
- selection algorithm
- computational complexity
- np hard
- single pass