Optimal parallelization of a sequential approximate Bayesian computation algorithm.
Jean-Michel MarinPierre PudloMohammed SedkiPublished in: WSC (2012)
Keyphrases
- high accuracy
- parallel version
- learning algorithm
- worst case
- cost function
- np hard
- preprocessing
- significant improvement
- detection algorithm
- optimal solution
- optimal path
- computational complexity
- dynamic programming
- path planning
- times faster
- piecewise linear
- globally optimal
- optimization algorithm
- segmentation algorithm
- computational cost
- experimental evaluation
- k means
- locally optimal
- exact solution
- optimal strategy
- linear programming
- posterior probability
- parallel algorithm
- matching algorithm
- objective function
- bayesian networks
- image segmentation