Sciweavers

Share
ICASSP
2011
IEEE
7 years 11 months ago
Generalized Restricted Isometry Property for alpha-stable random projections
The Restricted Isometry Property (RIP) is an important concept in compressed sensing. It is well known that many random matrices satisfy the RIP with high probability, whenever th...
Daniel Otero, Gonzalo R. Arce
RSA
2008
69views more  RSA 2008»
8 years 6 months ago
On variants of the Johnson-Lindenstrauss lemma
: The Johnson
Jirí Matousek
TIT
2002
142views more  TIT 2002»
8 years 6 months ago
A random matrix model of communication via antenna arrays
Abstract--A random matrix model is introduced that probabilistically describes the spatial and temporal multipath propagation between a transmitting and receiving antenna array wit...
Ralf R. Müller
CORR
2007
Springer
183views Education» more  CORR 2007»
8 years 7 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst
COMBINATORICS
2007
99views more  COMBINATORICS 2007»
8 years 7 months ago
Permutations Without Long Decreasing Subsequences and Random Matrices
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
Piotr Sniady
CORR
2008
Springer
110views Education» more  CORR 2008»
8 years 7 months ago
Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications
Let A be an n by N real valued random matrix, and HN denote the N-dimensional hypercube. For numerous random matrix ensembles, the expected number of k-dimensional faces of the ran...
David L. Donoho, Jared Tanner
STOC
2001
ACM
138views Algorithms» more  STOC 2001»
9 years 7 months ago
Fast computation of low rank matrix
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Dimitris Achlioptas, Frank McSherry
STOC
2005
ACM
139views Algorithms» more  STOC 2005»
9 years 7 months ago
Spectral norm of random matrices
We study the spectral norm of matrices M that can be factored as M = BA, where A is a random matrix with independent mean zero entries and B is a fixed matrix. Under the (4 + )-th ...
Van H. Vu
RECOMB
2002
Springer
9 years 7 months ago
Discovering local structure in gene expression data: the order-preserving submatrix problem
This paper concerns the discovery of patterns in gene expression matrices, in which each element gives the expression level of a given gene in a given experiment. Most existing me...
Amir Ben-Dor, Benny Chor, Richard M. Karp, Zohar Y...
books