Sciweavers

354 search results - page 25 / 71
» Approximate String Joins
Sort
View
DASFAA
2005
IEEE
136views Database» more  DASFAA 2005»
14 years 1 months ago
Distributed Intersection Join of Complex Interval Sequences
In many different application areas, e.g. space observation systems or engineering systems of world-wide operating companies, there is a need for an efficient distributed intersect...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SSDBM
2000
IEEE
109views Database» more  SSDBM 2000»
14 years 3 days ago
Toward Spatial Joins for Polygons
Efficient evaluation of spatial join is an important issue in spatial databases. The traditional evaluation strategy is to perform a join of “minimum bounding rectangles” (mbr...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
ICDAR
2009
IEEE
13 years 5 months ago
Bayesian Similarity Model Estimation for Approximate Recognized Text Search
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
Atsuhiro Takasu
CPM
2000
Springer
160views Combinatorics» more  CPM 2000»
14 years 2 days ago
Approximation Algorithms for Hamming Clustering Problems
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
Leszek Gasieniec, Jesper Jansson, Andrzej Lingas
CIKM
1997
Springer
13 years 12 months ago
Applications of Approximate Word Matching in Information Retrieval
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective ...
James C. French, Allison L. Powell, Eric Schulman