162 search results - page 7 / 33 » A Relational Approach to the Compilation of Sparse Matrix Pr... |
SCALESPACE
2005
Springer
14 years 29 days ago
2005
Springer
Matrix-valued images gain increasing importance both as the output of new imaging techniques and as the result of image processing operations, bearing the need for robust and effic...
ICML
2002
IEEE
14 years 8 months ago
2002
IEEE
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
ISPASS
2009
IEEE
14 years 2 months ago
2009
IEEE
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...