Login / Signup
An Exact Performance Bound for an O(m+n) Greedy Matching Procedure.
Andrew Shapira
Published in:
Electron. J. Comb. (1997)
Keyphrases
</>
matching procedure
matching process
lower bound
upper bound
disparity estimation
dynamic programming
similarity measure
worst case
real time
feature selection
multiscale