An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths.
Yijie HanTadao TakaokaPublished in: SWAT (2012)
Keyphrases
- theoretical analysis
- dynamic programming
- worst case
- matching algorithm
- detection algorithm
- optimization algorithm
- objective function
- high accuracy
- computational cost
- single pass
- selection algorithm
- times faster
- tree structure
- clustering method
- simulated annealing
- learning algorithm
- experimental evaluation
- np hard
- cost function
- k means
- preprocessing
- upper bound
- multi objective
- lower bound
- feature space
- similarity measure
- decision trees
- estimation algorithm
- image processing