910 search results - page 37 / 182 » Detecting False Matches in String Matching Algorithms |
158
click to vote
CPM
1999
Springer
15 years 7 months ago
1999
Springer
In this paper we focus on the problem of compressed pattern matching for the text compression using antidictionaries, which is a new compression scheme proposed recently by Crochem...
130
Voted
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
We investigate the problem of creating and analyzing samples of relational databases to find relationships between string-valued attributes. Our focus is on identifying attribute...
133
click to vote
VLDB
2004
ACM
15 years 8 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...
106
Voted
FUIN
2008
15 years 3 months ago
2008
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
BIRTHDAY
2010
Springer
15 years 6 months ago
2010
Springer
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...