186 search results - page 13 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
LSSC
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Recently we presented a new approach [5, 6] to the classification problem arising in data mining. It is based on the regularization network approach, but in contrast to ...
109
click to vote
SC
2009
ACM
15 years 2 months ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
SIAMSC
2010
14 years 4 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
163
click to vote
SIAMJO
2011
14 years 4 months ago
2011
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...