Sciweavers

125 search results - page 8 / 25
» Cross-Domain Approximate String Matching
Sort
View
77
Voted
COOPIS
2004
IEEE
15 years 1 months ago
Supporting Similarity Operations Based on Approximate String Matching on the Web
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
Eike Schallehn, Ingolf Geist, Kai-Uwe Sattler
CPM
2000
Springer
175views Combinatorics» more  CPM 2000»
15 years 1 months ago
Approximate String Matching over Ziv-Lempel Compressed Text
Abstract. We present a solution to the problem of performing approximate pattern matching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 an...
Juha Kärkkäinen, Gonzalo Navarro, Esko U...
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
15 years 2 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
CPM
2007
Springer
124views Combinatorics» more  CPM 2007»
15 years 3 months ago
Cache-Oblivious Index for Approximate String Matching
Wing-Kai Hon, Tak Wah Lam, Rahul Shah, Siu-Lung Ta...