598 search results - page 42 / 120 » The Structure of Sparse Resultant Matrices |
181
Voted
ICML
2005
IEEE
16 years 4 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...
127
Voted
ICDM
2009
IEEE
15 years 10 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...
147
Voted
IPPS
2003
IEEE
15 years 9 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...
132
Voted
LSSC
2001
Springer
15 years 8 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...
141
Voted
ICA
2007
Springer
15 years 5 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...