A new algorithm for computing Groebner bases.
Shuhong GaoFrank VolnyMingsheng WangPublished in: IACR Cryptol. ePrint Arch. (2010)
Keyphrases
- k means
- cost function
- dynamic programming
- learning algorithm
- simulated annealing
- single pass
- theoretical analysis
- expectation maximization
- high accuracy
- experimental evaluation
- similarity measure
- linear programming
- computationally efficient
- detection algorithm
- recognition algorithm
- memory requirements
- times faster
- experimental study
- np hard
- search space
- objective function
- computational complexity
- convex hull
- markov random field
- convergence rate
- evolutionary algorithm
- estimation algorithm
- probabilistic model