Sciweavers

9209 search results - page 11 / 1842
» Data Space Randomization
Sort
View
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
14 years 9 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
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...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
ICIP
2008
IEEE
16 years 7 months ago
On the estimation of geodesic paths on sampled manifolds under random projections
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 ...
Mona Mahmoudi, Pierre Vandergheynst, Matteo Sorci
164
Voted
CVPR
2010
IEEE
15 years 11 months ago
Weakly-Supervised Hashing in Kernel Space
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...
Yadong Mu, Jialie Shen, Shuicheng Yan
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 9 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
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...
Sanjeev Arora, Elad Hazan, Satyen Kale
122
Voted
WWW
2006
ACM
16 years 6 months ago
To randomize or not to randomize: space optimal summaries for hyperlink analysis
Tamás Sarlós, András A. Bencz...