An algorithm for calculating top-dimensional bounding chains.
J. Frederico CarvalhoMikael Vejdemo-JohanssonDanica KragicFlorian T. PokornyPublished in: PeerJ Comput. Sci. (2018)
Keyphrases
- learning algorithm
- experimental evaluation
- dynamic programming
- detection algorithm
- preprocessing
- theoretical analysis
- expectation maximization
- optimization algorithm
- significant improvement
- k means
- optimal solution
- objective function
- improved algorithm
- convex hull
- times faster
- convergence rate
- clustering method
- space complexity
- computationally efficient
- high accuracy
- computational complexity
- similarity measure
- input data
- least squares
- experimental study
- matching algorithm
- path planning
- np hard
- cost function
- genetic algorithm