1272 search results - page 38 / 255 » Approximate Parameterized Matching |
SPIRE
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
MM
2003
ACM
15 years 4 months ago
2003
ACM
Effective use of multimedia collections requires efficient and intuitive methods of searching and browsing. This work considers databases which store music and explores how these...
85
Voted
PDPTA
2003
15 years 13 days ago
2003
In this paper, we present three parallel flexible approximate string matching methods on a parallel architecture with heterogeneous workstations to gain supercomputer power at lo...
JOI
2007
14 years 11 months ago
2007
This paper presents a method for assessing the quality of similarity functions. The scenario taken into account is that of approximate data matching, in which it is necessary to d...
97
Voted
IJFCS
2002
14 years 10 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...