125 search results - page 15 / 25 » Cross-Domain Approximate String Matching |
IFIPTCS
2000
13 years 11 months ago
2000
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
ICDE
2011
IEEE
12 years 11 months ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
IQIS
2007
ACM
13 years 9 months ago
2007
ACM
Approximate join is an important part of many data cleaning and integration methodologies. Various similarity measures have been proposed for accurate and efficient matching of st...
FCT
2003
Springer
14 years 1 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...