9209 search results - page 11 / 1842 » Data Space Randomization |
153
Voted
MMM
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
111
Voted
ICIP
2008
IEEE
16 years 3 months ago
2008
IEEE
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
113
Voted
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform...
100
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
92
Voted
WWW
2006
ACM
16 years 2 months ago
2006
ACM
