Sciweavers

51 search results - page 3 / 11
» Approximate String Matching in LDAP Based on Edit Distance
Sort
View
VLDB
2005
ACM
93views Database» more  VLDB 2005»
13 years 11 months ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
CAIP
2009
Springer
246views Image Analysis» more  CAIP 2009»
13 years 11 months ago
A Novel Approach for Word Spotting Using Merge-Split Edit Distance
Edit distance matching has been used in literature for word spotting with characters taken as primitives. The recognition rate however, is limited by the segmentation inconsistenci...
Khurram Khurshid, Claudie Faure, Nicole Vincent
MIAR
2006
IEEE
14 years 11 days ago
Cerebral Vascular Tree Matching of 3D-RA Data Based on Tree Edit Distance
Abstract. In this paper, we present a novel approach to matching cerebral vascular trees obtained from 3D-RA data-sets based on minimization of tree edit distance. Our approach is ...
Tommy W. H. Tang, Albert C. S. Chung
ICALP
2001
Springer
13 years 10 months ago
Permutation Editing and Matching via Embeddings
Abstract. If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of chromosomal rearrangements in the form of deletions, block moves, inv...
Graham Cormode, S. Muthukrishnan, Süleyman Ce...
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
13 years 4 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen