Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants.
Sebastian BrandtDennis OlivettiPublished in: CoRR (2020)
Keyphrases
- upper bound
- lower bound
- worst case
- generalization error bounds
- matching algorithm
- minimum distance
- matching process
- real valued
- bipartite graph
- average case
- vc dimension
- lower and upper bounds
- feature points
- objective function
- error bounds
- image matching
- similarity measure
- shape matching
- pattern matching
- affine invariant
- generalization error
- feature matching
- upper and lower bounds
- optimal solution
- tight bounds