An Elementary Algorithm for Computing the Composition Factors of a Permutation Group.
Robert BealsPublished in: ISSAC (1993)
Keyphrases
- times faster
- optimization algorithm
- computationally efficient
- dynamic programming
- k means
- cost function
- segmentation method
- detection algorithm
- high accuracy
- worst case
- bayesian networks
- experimental evaluation
- simulated annealing
- significant improvement
- np hard
- input data
- improved algorithm
- segmentation algorithm
- selection algorithm
- objective function
- learning algorithm
- feature selection
- data sets
- machine learning
- recognition algorithm
- memory requirements
- convex hull
- matching algorithm
- social networks
- evolutionary algorithm
- image segmentation
- reinforcement learning
- theoretical analysis
- expectation maximization
- preprocessing
- search space