Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...
Julian McAuley, Teofilo de Campos, Tiberio Caetano
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...
A common practice in pattern recognition is to classify an unknown object by matching its feature vector with all the feature vectors stored in a database. When the number of clas...
Ying-Ho Liu, Wen-Hsiung Lin, Fu Chang, Chin-Chin L...
Abstract. Large area photo-mosaics are widely used in many different applications such as optical mapping, panorama creation and autonomous vehicle navigation. When the trajectory...