406 search results - page 30 / 82 » Database-friendly random projections |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents a new analysis for the orthogonal matching pursuit (OMP) algorithm. It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level O...
ICASSP
2008
IEEE
14 years 2 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 ...
JCB
2008
13 years 7 months ago
2008
Quantification of statistical significance is essential for the interpretation of protein structural similarity. To address this, a random model for protein structure comparison w...
SPAA
2010
ACM
13 years 7 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...