/logn) time algorithm for all pairs shortest paths.
Yijie HanPublished in: Inf. Process. Lett. (2008)
Keyphrases
- dynamic programming
- improved algorithm
- optimal solution
- computational complexity
- np hard
- single pass
- selection algorithm
- detection algorithm
- optimization algorithm
- experimental evaluation
- segmentation algorithm
- theoretical analysis
- worst case
- memory requirements
- times faster
- high accuracy
- probabilistic model
- search space
- learning algorithm
- computationally efficient
- cost function
- k means
- experimental study
- path planning
- clustering method
- neural network
- hardware implementation
- decision trees
- objective function
- tree structure
- motion estimation
- state space
- simulated annealing
- knn
- data sets
- least squares