Sciweavers

44 search results - page 1 / 9
» Spectral norm of random matrices
Sort
View
STOC
2005
ACM
139views Algorithms» more  STOC 2005»
14 years 5 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
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
13 years 4 months ago
A probabilistic framework for problems with real structured uncertainty in systems and control
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
Giuseppe Carlo Calafiore, Fabrizio Dabbene
CORR
2010
Springer
126views Education» more  CORR 2010»
12 years 11 months ago
Reed Muller Sensing Matrices and the LASSO
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
A. Robert Calderbank, Sina Jafarpour
PKDD
2004
Springer
116views Data Mining» more  PKDD 2004»
13 years 10 months ago
Random Matrices in Data Analysis
We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certai...
Dimitris Achlioptas
MP
2007
89views more  MP 2007»
13 years 4 months ago
Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
Let Bi be deterministic real symmetric m × m matrices, and ξi be independent random scalars with zero mean and “of order of one” (e.g., ξi ∼ N(0, 1)). We are interested to...
Arkadi Nemirovski