An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals.
Ulla KoppenhagenErnst W. MayrPublished in: ISSAC (1996)
Keyphrases
- dynamic programming
- learning algorithm
- optimal solution
- optimization algorithm
- preprocessing
- detection algorithm
- experimental evaluation
- computational complexity
- k means
- times faster
- clustering method
- theoretical analysis
- expectation maximization
- high accuracy
- computational cost
- np hard
- convergence rate
- globally optimal
- worst case
- linear programming
- search space
- lower bound
- optimal strategy
- optimal path
- weighting coefficients
- probabilistic model
- closed form
- tree structure
- cost function
- significant improvement
- data structure
- multiscale
- similarity measure