Sciweavers

679 search results - page 133 / 136
» Approximate Temporal Aggregation
Sort
View
GRAPHITE
2006
ACM
14 years 2 months ago
Two-stage compression for fast volume rendering of time-varying scalar data
This paper presents a two-stage compression method for accelerating GPU-based volume rendering of time-varying scalar data. Our method aims at reducing transfer time by compressin...
Daisuke Nagayasu, Fumihiko Ino, Kenichi Hagihara
RT
2004
Springer
14 years 1 months ago
All-Frequency Precomputed Radiance Transfer for Glossy Objects
We introduce a method based on precomputed radiance transfer (PRT) that allows interactive rendering of glossy surfaces and includes shadowing effects from dynamic, “all-frequen...
Xinguo Liu, Peter-Pike J. Sloan, Heung-Yeung Shum,...
RTSS
1999
IEEE
14 years 21 days ago
Deriving Deadlines and Periods for Real-Time Update Transactions
Typically, temporal validity of real-time data is maintained by periodic update transactions. In this paper, we examine the problem of period and deadline assignment for these upda...
Ming Xiong, Krithi Ramamritham
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
14 years 21 days ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson
VISUALIZATION
1998
IEEE
14 years 20 days ago
Eliminating popping artifacts in sheet buffer-based splatting
Splatting is a fast volume rendering algorithm which achieves its speed by projecting voxels in the form of pre-integrated interpolation kernels, or splats. Presently, two main va...
Klaus Mueller, Roger Crawfis