24 search results - page 4 / 5 » New and faster filters for multiple approximate string match... |
LCN
2008
IEEE
13 years 11 months ago
2008
IEEE
— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
DCC
1998
IEEE
13 years 9 months ago
1998
IEEE
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
EDBT
2004
ACM
14 years 5 months ago
2004
ACM
To effectively support today's global economy, database systems need to store and manipulate text data in multiple languages simultaneously. Current database systems do suppor...
GLOBECOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Fast and accurate Carrier Frequency Offset (CFO) estimation is a problem of significance in many multi-carrier modulation based systems, especially in uplink Orthogonal Frequency D...
WOB
2004
13 years 6 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...