598 search results - page 42 / 120 » The Structure of Sparse Resultant Matrices |
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
—We consider the problem of learning a linear combination of pre-specified kernel matrices in the Fisher discriminant analysis setting. Existing methods for such a task impose a...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions i...
LSSC
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we analyze a quasi-Monte Carlo method for solving systems of linear algebraic equations. It is well known that the convergence of Monte Carlo methods for numerical in...
ICA
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. This paper introduces gradient based method for robust assessment of the sparse pulse sources, such as motor unit innervation pulse trains in the filed of electromyograp...