Randomized Speedup of the Bellman-Ford Algorithm.
Michael J. BannisterDavid EppsteinPublished in: ANALCO (2012)
Keyphrases
- preprocessing
- theoretical analysis
- times faster
- cost function
- neural network
- convex hull
- improved algorithm
- objective function
- learning algorithm
- computational complexity
- search space
- np hard
- dynamic programming
- probabilistic model
- detection algorithm
- selection algorithm
- simulated annealing
- brute force
- single pass
- monte carlo
- randomized algorithm
- segmentation algorithm
- input data
- worst case
- experimental evaluation
- k means
- computationally efficient
- expectation maximization
- high accuracy
- matching algorithm
- linear program
- computational cost
- convergence rate
- support vector
- bayesian networks
- image sequences
- image segmentation
- randomized algorithms