Sciweavers

38 search results - page 2 / 8
» Condition Numbers of Gaussian Random Matrices
Sort
View
MP
2011
13 years 2 months ago
Null space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 8 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
COMBINATORICS
2007
99views more  COMBINATORICS 2007»
13 years 8 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
2010
Springer
66views Education» more  CORR 2010»
13 years 6 months ago
A Unique "Nonnegative" Solution to an Underdetermined System: from Vectors to Matrices
Abstract--This paper investigates the uniqueness of a nonnegative vector solution and the uniqueness of a positive semidefinite matrix solution to underdetermined linear systems. A...
Meng Wang, Weiyu Xu, Ao Tang
WSC
2008
13 years 10 months ago
Efficient simulation for tail probabilities of Gaussian random fields
We are interested in computing tail probabilities for the maxima of Gaussian random fields. In this paper, we discuss two special cases: random fields defined over a finite number...
Robert J. Adler, Jose Blanchet, Jingchen Liu