598 search results - page 26 / 120 » The Structure of Sparse Resultant Matrices |
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
Most existing sparse Gaussian process (g.p.) models seek computational advantages by basing their computations on a set of m basis functions that are the covariance function of th...
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...
CVPR
2010
IEEE
13 years 6 months ago
2010
IEEE
We address the problem of computing joint sparse representation of visual signal across multiple kernel-based representations. Such a problem arises naturally in supervised visual...
IDA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. The Matrix-Pencil approach to blind source separation estimates the mixing matrix from the Generalized Eigenvalue Decomposition (GEVD), or Exact Joint Diagonalization, of...
AMC
2004
13 years 8 months ago
2004
Estimates for the rank of A MN V - UA MN and more general displacement of A MN are presented,where A MN is the weighted pseudoinverse of a matrix A.The results are applied to the ...