441 search results - page 36 / 89 » Sparse Recovery Using Sparse Random Matrices |
TIT
2010
14 years 4 months ago
2010
Wideband analog signals push contemporary analog-to-digital conversion systems to their performance limits. In many applications, however, sampling at the Nyquist rate is inefficie...
101
click to vote
ICANN
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
139
Voted
PARLE
1994
15 years 1 months ago
1994
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
AAECC
2007
Springer
14 years 10 months ago
2007
Springer
Abstract. We present new performance models and a new, more compact data structure for cache blocking when applied to the sparse matrixvector multiply (SpM×V) operation, y ← y +...
104
click to vote
HPDC
2011
IEEE
14 years 1 months ago
2011
IEEE
In today’s high performance computing practice, fail-stop failures are often tolerated by checkpointing. While checkpointing is a very general technique and can often be applied...