A Scalable Dataflow Implementation of Curran's Approximation Algorithm.
Anna Maria NestorovEnrico ReggianiHristina PalikarevaPavel BurovskiyTobias BeckerMarco D. SantambrogioPublished in: IPDPS Workshops (2017)
Keyphrases
- computational cost
- experimental evaluation
- memory efficient
- dynamic programming
- optimal solution
- single pass
- linear programming
- cost function
- theoretical analysis
- times faster
- approximation ratio
- np hard
- learning algorithm
- search space
- preprocessing
- matching algorithm
- closed form
- monte carlo
- detection algorithm
- high accuracy
- computationally efficient
- approximation algorithms
- parallel implementation
- computational complexity
- objective function
- polynomial time approximation
- clustering method
- optimization algorithm
- expectation maximization
- particle swarm optimization
- input data
- simulated annealing
- probabilistic model
- significant improvement