Sciweavers

54 search results - page 6 / 11
» Approximate String Search in Spatial Databases
Sort
View
TODS
2002
92views more  TODS 2002»
13 years 7 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
WWW
2009
ACM
14 years 8 months ago
Exploiting web search to generate synonyms for entities
Tasks recognizing named entities such as products, people names, or locations from documents have recently received significant attention in the literature. Many solutions to thes...
Surajit Chaudhuri, Venkatesh Ganti, Dong Xin
EDBT
2006
ACM
154views Database» more  EDBT 2006»
13 years 11 months ago
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
Christoph Brochhaus, Marc Wichterich, Thomas Seidl
ISM
2006
IEEE
174views Multimedia» more  ISM 2006»
14 years 1 months ago
Fast Similarity Search for High-Dimensional Dataset
This paper addresses the challenging problem of rapidly searching and matching high-dimensional features for the applications of multimedia database retrieval and pattern recognit...
Quan Wang, Suya You
GIS
2002
ACM
13 years 7 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...