Selecting Base Points for the Schreier-Sims Algorithm for Matrix Groups.
Scott H. MurrayE. A. O'BrienPublished in: J. Symb. Comput. (1995)
Keyphrases
- times faster
- selection algorithm
- objective function
- computational cost
- k means
- segmentation algorithm
- learning algorithm
- similarity matrix
- particle swarm optimization
- high accuracy
- experimental evaluation
- dynamic programming
- np hard
- cost function
- matching algorithm
- optimization algorithm
- preprocessing
- search space
- significant improvement
- linear programming
- expectation maximization
- bayesian networks
- lower bound
- simulated annealing
- input data
- worst case
- computational complexity
- optimal solution
- neural network
- transformation matrix