Sciweavers

900 search results - page 154 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
CGF
2006
100views more  CGF 2006»
13 years 8 months ago
Ray Tracing Animated Scenes using Motion Decomposition
Though ray tracing has recently become interactive, its high precomputation time for building spatial indices usually limits its applications to walkthroughs of static scenes. Thi...
Johannes Günther, Heiko Friedrich, Ingo Wald,...
OOPSLA
2005
Springer
14 years 2 months ago
Demand-driven points-to analysis for Java
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
Manu Sridharan, Denis Gopan, Lexin Shan, Rastislav...
ISPASS
2003
IEEE
14 years 1 months ago
Performance study of a cluster runtime system for dynamic interactive stream-oriented applications
Emerging application domains such as interactive vision, animation, and multimedia collaboration display dynamic scalable parallelism, and high computational requirements, making ...
Arnab Paul, Nissim Harel, Sameer Adhikari, Bikash ...
ECCV
2008
Springer
14 years 10 months ago
Temporal Dithering of Illumination for Fast Active Vision
Active vision techniques use programmable light sources, such as projectors, whose intensities can be controlled over space and time. We present a broad framework for fast active v...
Srinivasa G. Narasimhan, Sanjeev J. Koppal, Shunta...
HPCA
2004
IEEE
14 years 9 months ago
Out-of-Order Commit Processors
Modern out-of-order processors tolerate long latency memory operations by supporting a large number of inflight instructions. This is particularly useful in numerical applications...
Adrián Cristal, Daniel Ortega, Josep Llosa,...