Sciweavers

54 search results - page 3 / 11
» Approximate String Search in Spatial Databases
Sort
View
SPIRE
1999
Springer
13 years 9 months ago
Cross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
Daniel P. Lopresti, Gordon T. Wilfong
COOPIS
2004
IEEE
13 years 9 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
ADC
2006
Springer
136views Database» more  ADC 2006»
13 years 11 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 5 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
SIGMOD
1989
ACM
94views Database» more  SIGMOD 1989»
13 years 9 months ago
Redundancy in Spatial Databases
Spatial objects other than points and boxes can be stored in spatial indexes, but the techniques usually require the use of approximations that can be arbitrarily bad. This leads ...
Jack A. Orenstein