1816 search results - page 200 / 364 » Trace oblivious computation |
SI3D
2005
ACM
14 years 2 months ago
2005
ACM
It is difficult to obtain a specific region within unsegmented volume data (region of interest, ROI). The user must first segment the volume, a task which itself involves signi...
ICS
2010
Tsinghua U.
13 years 11 months ago
2010
Tsinghua U.
Existing supercomputers have hundreds of thousands of processor cores, and future systems may have hundreds of millions. Developers need detailed performance measurements to tune ...
EGH
2010
Springer
13 years 7 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...
EGH
2009
Springer
13 years 6 months ago
2009
Springer
A major factor for the efficiency of ray tracing is the use of good acceleration structures. Recently, bounding volume hierarchies (BVHs) have become the preferred acceleration st...
ECWEB
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Recommendation technologies have traditionally been used in domains such as E-commerce and Web navigation to recommend resources to customers so as to help them to get th...