Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm.
Ilya KapovichMark C. BellPublished in: Exp. Math. (2019)
Keyphrases
- worst case
- k means
- theoretical analysis
- detection algorithm
- optimal solution
- dynamic programming
- neural network
- improved algorithm
- times faster
- path planning
- mobile robot
- computational cost
- objective function
- high accuracy
- optimization algorithm
- segmentation algorithm
- matching algorithm
- recognition algorithm
- strongly polynomial
- np hard
- cost function
- learning algorithm
- computationally efficient
- particle filter
- particle swarm optimization
- probabilistic model
- classification algorithm
- multi objective
- preprocessing
- similarity measure