Fraction-free algorithm for the computation of diagonal forms matrices over Ore domains using Gr{ö}bner bases
Viktor LevandovskyyKristina SchindelarPublished in: CoRR (2011)
Keyphrases
- learning algorithm
- computational cost
- preprocessing
- search space
- k means
- dynamic programming
- optimization algorithm
- np hard
- significant improvement
- simulated annealing
- worst case
- cost function
- computational complexity
- optimal solution
- recognition algorithm
- continuous domains
- convergence rate
- segmentation algorithm
- linear programming
- high accuracy
- objective function
- similarity measure
- image sequences