207 search results - page 6 / 42 » The Polynomial Method for Random Matrices |
FOCM
2008
13 years 8 months ago
2008
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
ISSAC
1997
Springer
14 years 18 days ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— Joint eigenvalue distribution of the noncentral complex Wishart matrix, i.e. HH∗ where H is the nonzero-mean complex Gaussian random channel matrix of a multiple-inpu...
NIPS
2004
13 years 9 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...