Faster change of order algorithm for Gröbner bases under shape and stability assumptions.
Jérémy BerthomieuVincent NeigerMohab Safey El DinPublished in: CoRR (2022)
Keyphrases
- experimental evaluation
- times faster
- matching algorithm
- optimization algorithm
- high accuracy
- preprocessing
- np hard
- learning algorithm
- computationally efficient
- linear programming
- objective function
- k means
- dynamic programming
- computational complexity
- memory efficient
- highly efficient
- neural network
- energy function
- expectation maximization
- search space
- probabilistic model
- computational cost
- cost function
- particle swarm optimization
- segmentation algorithm
- optimal solution
- markov random field
- image registration
- computational efficiency
- prior information
- recognition algorithm