An Algorithm to Check Whether a Basis of a Parametric Polynomial System is a Comprehensive Gröbner Basis and the Associated Completion Algorithm.
Deepak KapurYiming YangPublished in: ISSAC (2015)
Keyphrases
- preprocessing
- computational complexity
- optimization algorithm
- high accuracy
- computational cost
- times faster
- optimal solution
- k means
- matching algorithm
- detection algorithm
- worst case
- objective function
- theoretical analysis
- particle swarm optimization
- probabilistic model
- scheduling problem
- graph cuts
- segmentation algorithm
- np hard
- hidden markov models
- ant colony optimization
- cost function
- computational efficiency
- data sets
- convex hull
- recognition algorithm