Sciweavers

274 search results - page 36 / 55
» Approximating Edit Distance Efficiently
Sort
View
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
13 years 11 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
GIS
2002
ACM
13 years 9 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...
ICDE
2008
IEEE
146views Database» more  ICDE 2008»
14 years 11 months ago
Handling Uncertain Data in Array Database Systems
Scientific and intelligence applications have special data handling needs. In these settings, data does not fit the standard model of short coded records that had dominated the dat...
Tingjian Ge, Stanley B. Zdonik
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
14 years 11 months ago
Answering Imprecise Queries over Autonomous Web Databases
Current approaches for answering queries with imprecise constraints require user-specific distance metrics and importance measures for attributes of interest - metrics that are ha...
Ullas Nambiar, Subbarao Kambhampati
ICASSP
2011
IEEE
13 years 6 months ago
Searching in one billion vectors: re-rank with source coding
Recent indexing techniques inspired by source coding have been shown successful to index billions of high-dimensional vectors in memory. In this paper, we propose an approach that ...
Hervé Jégou and Romain Tavenard and Matthijs Dou...