1245 search results - page 58 / 249 » Binary Sparse Coding |
157
Voted
NAA
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we develop a probabilistic model for estimation of the numbers of cache misses during the sparse matrix-vector multiplication (for both general and symmetric matrice...
103
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Several methods have been proposed in the literature for the local enumeration of dense references for arrays distributed by the CYCLIC(k) data-distributionin High Performance For...
IEEECIT
2010
IEEE
15 years 28 days ago
2010
IEEE
—This paper analyses remainder signs determinant issue in the computer fixed-point division operation. Together with the manual binary number division, the true code addition and...
ECOOP
1998
Springer
15 years 6 months ago
1998
Springer
Binary component adaptation (BCA) allows components to be adapted and evolved in binary form and on-the-fly (during program loading). BCA rewrites component binaries before (or whi...
101
click to vote
AAECC
2006
Springer
15 years 8 months ago
2006
Springer
Abstract Dirty paper coding are relevant for wireless networks, multiuser channels, and digital watermarking. We show that the problem of dirty paper is essentially equivalent to s...