Sciweavers

108 search results - page 9 / 22
» Fast Convolutions and Their Applications in Approximate Stri...
Sort
View
IFIPTCS
2000
13 years 11 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
12 years 11 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 27 days ago
Merging the Results of Approximate Match Operations
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...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...

Book
4675views
15 years 4 months ago
Mathematics of The Discrete Fourier Transform (DFT) with Audio Applications
"The Discrete Fourier Transform (DFT) can be understood as a numerical approximation to the Fourier transform. However, the DFT has its own exact Fourier theory, which is the ...
Julius O. Smith III
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
14 years 7 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos