DFS is Unsparsable and Lookahead Can Help in Maximal Matching.

Kitti Gelle Szabolcs Iván

Published in: Acta Cybern. (2018)

Keyphrases

matching algorithm
pattern matching
image matching
matching process
feature points
graph matching
databases
machine learning
computer vision
similarity measure
upper bound
string matching
minimum distance
ontology matching
optimal matching