A critical-pair/completion algorithm for finitely generated ideals in rings.
Bruno BuchbergerPublished in: Logic and Machines (1983)
Keyphrases
- computational cost
- cost function
- matching algorithm
- preprocessing
- np hard
- dynamic programming
- experimental study
- detection algorithm
- learning algorithm
- improved algorithm
- experimental evaluation
- simulated annealing
- computationally efficient
- worst case
- classification algorithm
- segmentation algorithm
- pairwise
- estimation algorithm
- memory requirements
- convergence rate
- linear programming
- recognition algorithm
- theoretical analysis
- particle swarm optimization
- semi supervised
- image sequences
- decision trees