A speed-up of the algorithm for computing comprehensive Gröbner systems.
Katsusuke NabeshimaPublished in: ISSAC (2007)
Keyphrases
- optimal solution
- experimental evaluation
- preprocessing
- learning algorithm
- path planning
- cost function
- computational efficiency
- multiscale
- dynamic programming
- significant improvement
- high accuracy
- worst case
- particle swarm optimization
- theoretical analysis
- optimization algorithm
- times faster
- computationally efficient
- segmentation algorithm
- expectation maximization
- clustering method
- computational cost
- k means
- computational complexity
- objective function
- similarity measure
- image processing
- simulated annealing
- input data
- probabilistic model
- neural network
- np hard
- expert systems
- decision trees
- numerically stable