A Parallel Approximation Algorithm for Maximizing Submodular b-Matching.
S. M. FerdousAlex PothenArif KhanAjay PanyalaMahantesh HalappanavarPublished in: CoRR (2021)
Keyphrases
- matching algorithm
- learning algorithm
- approximation ratio
- detection algorithm
- dynamic programming
- theoretical analysis
- preprocessing
- optimal solution
- experimental evaluation
- high accuracy
- parallel implementation
- recognition algorithm
- greedy algorithm
- keypoints
- string matching
- particle swarm optimization
- worst case
- probabilistic model
- computational cost
- np hard
- k means
- search space
- computational complexity
- objective function
- similarity measure
- segmentation algorithm
- multi objective
- significant improvement
- parallel computation
- depth first search