33 search results - page 5 / 7 » Orthogonal locality preserving indexing |
EDBT
2009
ACM
14 years 4 months ago
2009
ACM
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
WWW
2007
ACM
14 years 10 months ago
2007
ACM
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
EWCBR
2004
Springer
14 years 3 months ago
2004
Springer
Textual CBR systems solve problems by reusing experiences that are in textual form. Knowledge-rich comparison of textual cases remains an important challenge for these systems. How...
DKE
2006
13 years 9 months ago
2006
Density biased sampling (DBS) has been proposed to address the limitations of Uniform sampling, by producing the desired probability distribution in the sample. The ease of produc...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data poin...