On Sampling Generating Sets of Finite Groups and Product Replacement Algorithm (extended abstract).
Igor PakSergey BratusPublished in: ISSAC (1999)
Keyphrases
- extended abstract
- times faster
- computational cost
- computational complexity
- significant improvement
- sampling algorithm
- expectation maximization
- experimental evaluation
- learning algorithm
- improved algorithm
- preprocessing
- recognition algorithm
- detection algorithm
- high accuracy
- worst case
- matching algorithm
- dynamic programming
- theoretical analysis
- segmentation algorithm
- similarity measure
- computationally efficient
- np hard
- cost function
- lower bound
- optimal solution
- np complete
- knn
- probabilistic model
- optimization algorithm
- tree structure
- monte carlo
- multi objective
- search space
- objective function
- sampled data