An algorithm for computing invariants of linear actions of algebraic groups up to a given degree.
Thomas BayerPublished in: J. Symb. Comput. (2003)
Keyphrases
- computational cost
- optimization algorithm
- k means
- np hard
- similarity measure
- segmentation algorithm
- experimental evaluation
- dynamic programming
- cost function
- matching algorithm
- preprocessing
- computational complexity
- convergence rate
- clustering method
- detection algorithm
- objective function
- theoretical analysis
- input data
- linear programming
- significant improvement
- optimal solution
- computationally efficient
- simulated annealing
- worst case
- image matching
- closed form
- improved algorithm
- piecewise linear
- integer arithmetic