158 search results - page 24 / 32 » High dimensional reverse nearest neighbor queries |
EDBT
2009
ACM
15 years 1 months ago
2009
ACM
Given a set of n query points in a general metric space, a metricspace skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consid...
162
click to vote
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
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...
ICML
2004
IEEE
15 years 3 months ago
2004
IEEE
We investigate how to learn a kernel matrix for high dimensional data that lies on or near a low dimensional manifold. Noting that the kernel matrix implicitly maps the data into ...
200
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
In a mobile service scenario, users query a server for nearby points of interest but they may not want to disclose their locations to the service. Intuitively, location privacy may...
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...