On Parallelizing Benson's Algorithm: - Limits and Opportunities.
H. Martin BückerAndreas LöhneBenjamin WeißingGerhard W. ZumbuschPublished in: ICCSA (2) (2018)
Keyphrases
- dynamic programming
- theoretical analysis
- experimental evaluation
- optimal solution
- preprocessing
- single pass
- high accuracy
- cost function
- significant improvement
- search space
- improved algorithm
- computational cost
- neural network
- computationally efficient
- segmentation algorithm
- convergence rate
- convex hull
- recognition algorithm
- parallel implementation
- times faster
- worst case
- experimental study
- k means
- computational complexity
- tree structure
- matching algorithm
- simulated annealing
- np hard
- similarity measure
- image processing
- learning algorithm