186 search results - page 13 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
180
Voted
CORR
2011
Springer
15 years 25 days 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...
166
click to vote
LSSC
2001
Springer
15 years 10 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 ...
196
click to vote
SC
2009
ACM
15 years 10 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...
172
click to vote
SIAMSC
2010
15 years 17 days 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...
287
click to vote
SIAMJO
2011
15 years 23 days 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...