An algorithm for constructing representations of finite groups.
Vahid Dabbaghian-AbdolyPublished in: J. Symb. Comput. (2005)
Keyphrases
- objective function
- times faster
- computational complexity
- preprocessing
- detection algorithm
- k means
- cost function
- dynamic programming
- improved algorithm
- matching algorithm
- segmentation algorithm
- simulated annealing
- experimental evaluation
- np hard
- data sets
- worst case
- particle swarm optimization
- expectation maximization
- computationally efficient
- theoretical analysis
- optimal solution
- learning algorithm
- estimation algorithm
- selection algorithm
- recognition algorithm
- clustering method
- input data
- linear programming
- computational cost
- lower bound