An Algorithm for Computing a Minimal Comprehensive Gröbner\, Basis of a Parametric Polynomial System.
Deepak KapurYiming YangPublished in: CoRR (2020)
Keyphrases
- computational cost
- computational complexity
- preprocessing
- detection algorithm
- high accuracy
- numerically stable
- improved algorithm
- convergence rate
- computationally efficient
- k means
- search space
- neural network
- optimal solution
- times faster
- matching algorithm
- clustering method
- dynamic programming
- optimization algorithm
- np hard
- theoretical analysis
- linear programming
- cost function
- worst case
- recognition algorithm
- learning algorithm
- parametric models
- experimental evaluation