13 search results - page 2 / 3 » A Sparser Johnson-Lindenstrauss Transform |
SODA
2008
ACM
13 years 7 months ago
2008
ACM
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
ICIP
2009
IEEE
14 years 6 months ago
2009
IEEE
Sparse Orthonormal Transforms (SOT) has recently been proposed as a data compression method that can achieve sparser representations in transform domain. Given initial conditions,...
DOCENG
2003
ACM
13 years 11 months ago
2003
ACM
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tr...
TASLP
2008
13 years 5 months ago
2008
This paper investigates the use of sparse overcomplete decompositions for audio coding. Audio signals are decomposed over a redundant union of modified discrete cosine transform (M...