2570 search results - page 346 / 514 » Fast Algorithms For The Computation Of Ranklets |
153
Voted
EGH
2010
Springer
15 years 1 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
140
Voted
DAC
2006
ACM
15 years 9 months ago
2006
ACM
This article describes a new software-based on-line memory compression algorithm for embedded systems and presents a method of adaptively managing the uncompressed and compressed ...
122
Voted
RT
2004
Springer
15 years 8 months ago
2004
Springer
With the advancements in realtime ray tracing and new global illumination algorithms we are now able to render the most important illumination effects at interactive rates. One of...
104
Voted
FPL
2003
Springer
15 years 8 months ago
2003
Springer
In this paper we present a single-chip FPGA full encryptor/decryptor core design of the AES algorithm. Our design performs all of them, encryption, decryption and key scheduling pr...
120
click to vote
ICPP
1990
IEEE
15 years 7 months ago
1990
IEEE
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...