Sciweavers

402 search results - page 53 / 81
» Nearest Surrounder Queries
Sort
View
ICDE
2002
IEEE
143views Database» more  ICDE 2002»
14 years 9 months ago
Discovering Similar Multidimensional Trajectories
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
Michail Vlachos, Dimitrios Gunopulos, George Kolli...
VLDB
2004
ACM
125views Database» more  VLDB 2004»
14 years 1 months ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian
CVPR
2004
IEEE
14 years 9 months ago
Learning Methods for Generic Object Recognition with Invariance to Pose and Lighting
We assess the applicability of several popular learning methods for the problem of recognizing generic visual categories with invariance to pose, lighting, and surrounding clutter...
Fu Jie Huang, Léon Bottou, Yann LeCun
TKDE
2010
197views more  TKDE 2010»
13 years 2 months ago
Filtering Data Streams for Entity-Based Continuous Queries
The idea of allowing query users to relax their correctness requirements in order to improve performance of a data stream management system (e.g., location-based services and senso...
Reynold Cheng, Benjamin C. M. Kao, Alan Kwan, Suni...
FOCS
2008
IEEE
14 years 2 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder