10805 search results - page 289 / 2161 » Mapping Computation with No Memory |
189
click to vote
ICCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
173
click to vote
CAP
2010
15 years 1 months ago
2010
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
220
click to vote
IJNSEC
2010
15 years 1 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
166
click to vote
ASPLOS
2009
ACM
16 years 1 months ago
2009
ACM
This paper explores the architectural implications of integrating computation and molecular probes to form nanoscale sensor processors (nSP). We show how nSPs may enable new compu...
153
click to vote
ERSA
2008
15 years 8 months ago
2008
- This paper presents a framework that improves the portability and ease-of-use issues of current Reconfigurable Computers (RCs). These two drawbacks should be solved in order for ...