406 search results - page 22 / 82 » Database-friendly random projections |
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
STOC
2006
ACM
14 years 8 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
ICMCS
2007
IEEE
14 years 1 months ago
2007
IEEE
Content-based signatures are designed to be a robust bitstream representation of the content so as to enable content identi cation even though the original content may go through ...