On the Complexity of the Groebner-Bases Algorithm over K[x, y, z].
Franz WinklerPublished in: EUROSAM (1984)
Keyphrases
- computational complexity
- learning algorithm
- preprocessing
- computational cost
- worst case
- convergence rate
- dynamic programming
- space complexity
- times faster
- cost function
- high accuracy
- single pass
- improved algorithm
- matching algorithm
- detection algorithm
- expectation maximization
- experimental evaluation
- k means
- optimal solution
- objective function
- multiscale
- input image
- scheduling problem
- simulated annealing
- search space
- experimental study
- classification algorithm
- video sequences
- decision problems
- face recognition
- complexity analysis
- neural network