Sciweavers

81 search results - page 1 / 17
» A Fast Random Sampling Algorithm for Sparsifying Matrices
Sort
View
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
14 years 2 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
FOCM
2008
156views more  FOCM 2008»
13 years 11 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
APPROX
2008
Springer
102views Algorithms» more  APPROX 2008»
14 years 27 days ago
Dense Fast Random Projections and Lean Walsh Transforms
Random projection methods give distributions over k
Edo Liberty, Nir Ailon, Amit Singer
KELSI
2004
Springer
14 years 4 months ago
A Randomized Algorithm for Distance Matrix Calculations in Multiple Sequence Alignment
Multiple sequence alignment (MSA) is a vital problem in biology. Optimal alignment of multiple sequences becomes impractical even for a modest number of sequences [1] since the gen...
Sanguthevar Rajasekaran, Vishal Thapar, Hardik Dav...
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
14 years 10 days ago
MACH: Fast Randomized Tensor Decompositions
Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer visio...
Charalampos E. Tsourakakis