186 search results - page 27 / 38 » Run-Time Techniques for Parallelizing Sparse Matrix Problems |
135
click to vote
RECSYS
2010
ACM
15 years 4 months ago
2010
ACM
Since the development of the comparably simple neighborhood-based methods in the 1990s, a plethora of techniques has been developed to improve various aspects of collaborative fil...
185
click to vote
SIAMSC
2011
14 years 11 months ago
2011
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
214
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In the past decade there has been a great interest in a synthesis-based model for signals, based on sparse and redundant representations. Such a model assumes that the signal of i...
149
click to vote
JSS
2007
15 years 4 months ago
2007
Recently, the issue of Statistic Disclosure Control (SDC) has attracted much attention. SDC is a very important part of data security dealing with the protection of databases. Micr...
158
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...