Sciweavers

910 search results - page 65 / 182
» Detecting False Matches in String Matching Algorithms
Sort
View
CAINE
2008
15 years 4 months ago
Matching 2D Fragments of Objects
This paper describes an algorithm that pieces together 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological frag...
Catherine Stringfellow, Richard Simpson, H. Bui, Y...
WIAMIS
2009
IEEE
15 years 9 months ago
Automatic topic detection strategy for information retrieval in spoken document
This paper suggests an alternative solution for the task of spoken document retrieval (SDR). The proposed system runs retrieval on multi-level transcriptions (word and phone) prod...
Shan Jin, Hemant Misra, Thomas Sikora, Joemon M. J...
CORR
2010
Springer
238views Education» more  CORR 2010»
15 years 3 months ago
Face Identification by SIFT-based Complete Graph Topology
This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully us...
Dakshina Ranjan Kisku, Ajita Rattani, Enrico Gross...
CIARP
2009
Springer
15 years 9 months ago
Morphological Shape Context: Semi-locality and Robust Matching in Shape Recognition
Abstract. We present a novel shape recognition method based on an algorithm to detect contrasted level lines for extraction, on Shape Context for encoding and on an a contrario app...
Mariano Tepper, Francisco Gómez, Pablo Mus&...
SPIRE
2001
Springer
15 years 7 months ago
Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms
Two algorithms are presented that solve the problem of recovering the longest common subsequence of two strings. The £rst algorithm is an improvement of Hirschberg’s divide-andc...
Maxime Crochemore, Costas S. Iliopoulos, Yoan J. P...