1272 search results - page 133 / 255 » Approximate Parameterized Matching |
143
Voted
ER
2007
Springer
15 years 9 months ago
2007
Springer
Approximate data matching applications typically use similarity functions to quantify the degree of likeness between two data instances. There are several similarity functions ava...
125
Voted
ISM
2006
IEEE
15 years 9 months ago
2006
IEEE
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
100
Voted
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
We show that linear probing requires 5-independent hash functions for expected constant-time performance, matching an upper bound of [Pagh et al. STOC’07]. For (1 + ε)-approxima...
118
click to vote
MUC
1992
15 years 7 months ago
1992
This paper reports on the results of the adjunct test performed by GE for the MUC-4 evaluation of text processing systems . In this test, we evaluated the effect of an object-orie...
116
Voted
CSB
2005
IEEE
15 years 9 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...