A bound for the Rosenfeld-Gröbner algorithm.
Oleg GolubitskyMarina V. KondratievaMarc Moreno MazaAlexey OvchinnikovPublished in: J. Symb. Comput. (2008)
Keyphrases
- worst case
- learning algorithm
- complexity bounds
- computational complexity
- high accuracy
- dynamic programming
- matching algorithm
- optimization algorithm
- segmentation algorithm
- k means
- significant improvement
- numerically stable
- computational efficiency
- input data
- computational cost
- probabilistic model
- scheduling problem
- cost function
- simulated annealing
- preprocessing
- optimal solution
- objective function
- detection algorithm
- clustering method
- similarity measure
- image sequences
- times faster
- computer vision
- data sets