n) time algorithm for all pairs shortest paths.
Yijie HanTadao TakaokaPublished in: J. Discrete Algorithms (2016)
Keyphrases
- experimental evaluation
- objective function
- dynamic programming
- learning algorithm
- detection algorithm
- improved algorithm
- np hard
- computational complexity
- particle swarm optimization
- optimization algorithm
- support vector machine svm
- single pass
- classification algorithm
- theoretical analysis
- computationally efficient
- expectation maximization
- times faster
- memory requirements
- probabilistic model
- multi objective
- preprocessing
- similarity measure
- convex hull
- convergence rate
- recognition algorithm
- hardware implementation
- simulated annealing
- high accuracy
- worst case
- computational cost
- mobile robot
- cost function
- significant improvement
- image processing