510 search results - page 23 / 102 » Sparse probabilistic projections |
116
click to vote
NAA
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrice...
107
click to vote
SCALESPACE
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a statistical model for textures that uses a non-negative decomposition on a set of local atoms learned from an exemplar. This model is described by the varianc...
ASIACRYPT
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
102
click to vote
STOC
2006
ACM
15 years 10 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 ...
ICASSP
2008
IEEE
15 years 4 months ago
2008
IEEE
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...