133 search results - page 14 / 27 » Approximate Nearest Subspace Search |
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
Given a multidimensional 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 proc...
JMLR
2010
13 years 2 months ago
2010
The goal of sufficient dimension reduction in supervised learning is to find the lowdimensional subspace of input features that is `sufficient' for predicting output values. ...
ECCV
2010
Springer
14 years 24 days ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
GIS
2005
ACM
14 years 8 months ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
VLSISP
2010
13 years 6 months ago
2010
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...