10805 search results - page 249 / 2161 » Mapping Computation with No Memory |
179
click to vote
EH
2005
IEEE
16 years 7 days ago
2005
IEEE
This paper proposes an original approach to the reliability analysis for Embryonics [4], by introducing the accuracy threshold measure, borrowed from fault-tolerant quantum comput...
148
click to vote
CHES
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We present a new method for computing the scalar multiplication on Koblitz curves. Our method is as fast as the fastest known technique but requires much less memory. We ...
181
click to vote
IFIP
2004
Springer
16 years 1 hour ago
2004
Springer
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
201
click to vote
CGF
2011
15 years 1 months ago
2011
Due to its versatility, speed and robustness, shadow mapping has always been a popular algorithm for fast hard
169
click to vote
PPOPP
2003
ACM
15 years 12 months ago
2003
ACM
In programming high performance applications, shared address-space platforms are preferable for fine-grained computation, while distributed address-space platforms are more suita...