Sciweavers

147 search results - page 1 / 30
» Very sparse random projections
Sort
View
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 5 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
ICASSP
2008
IEEE
13 years 11 months ago
A compressive beamforming method
Compressive Sensing (CS) is an emerging area which uses a relatively small number of non-traditional samples in the form of randomized projections to reconstruct sparse or compres...
Ali Cafer Gurbuz, James H. McClellan, Volkan Cevhe...
CORR
2011
Springer
148views Education» more  CORR 2011»
12 years 11 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport
APPROX
2008
Springer
102views Algorithms» more  APPROX 2008»
13 years 6 months ago
Dense Fast Random Projections and Lean Walsh Transforms
Random projection methods give distributions over k
Edo Liberty, Nir Ailon, Amit Singer
ICASSP
2008
IEEE
13 years 11 months ago
Finding needles in noisy haystacks
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 ...
Rui M. Castro, Jarvis Haupt, Robert Nowak, Gil M. ...