573 search results - page 10 / 115 » On Wiedemann's Method of Solving Sparse Linear Systems |
109
click to vote
ALGORITHMICA
1999
14 years 11 months ago
1999
We describe a coarse-grain parallel software system for the homogeneous solution of linear systems. Our solutions are symbolic, i.e., exact rather than numerical approximations. O...
105
click to vote
ESANN
2004
15 years 1 months ago
2004
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
FOCS
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax = b where A is a symmetric positive de...
106
Voted
JMLR
2008
14 years 11 months ago
2008
Linear support vector machines (SVM) are useful for classifying large-scale sparse data. Problems with sparse features are common in applications such as document classification a...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
In this paper, we propose a new algorithm, TLS-FOCUSS, for sparse recovery for large underdetermined linear systems, based on total least square (TLS) method and FOCUSS(FOCal Unde...