Sciweavers

300 search results - page 32 / 60
» Constrained Nearest Neighbor Queries
Sort
View
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
A Generic Framework for Handling Uncertain Data with Local Correlations
Data uncertainty is ubiquitous in many real-world applications such as sensor/RFID data analysis. In this paper, we investigate uncertain data that exhibit local correlations, tha...
Xiang Lian, Lei Chen 0002
DEXA
2010
Springer
213views Database» more  DEXA 2010»
13 years 8 months ago
Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...
Ugur Demiryurek, Farnoush Banaei Kashani, Cyrus Sh...
PAMI
2011
13 years 2 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 9 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
IJFCS
2002
122views more  IJFCS 2002»
13 years 7 months ago
The Delaunay Hierarchy
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
Olivier Devillers