Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants.
Sebastian BrandtDennis OlivettiPublished in: PODC (2020)
Keyphrases
- lower bound
- upper bound
- worst case
- generalization error bounds
- minimum distance
- matching algorithm
- upper and lower bounds
- matching process
- pattern matching
- bipartite graph
- graph model
- image matching
- real valued
- shape matching
- feature matching
- error bounds
- matching scheme
- image set
- database
- keypoints
- np hard
- search algorithm
- objective function
- machine learning