Sciweavers

126 search results - page 15 / 26
» Directly Addressable Variable-Length Codes
Sort
View
JGTOOLS
2006
107views more  JGTOOLS 2006»
13 years 8 months ago
Efficient Shadows for Sampled Environment Maps
This paper addresses the problem of efficiently calculating shadows from environment maps in the context of ray-tracing. Since accurate rendering of shadows from environment maps ...
Aner Ben-Artzi, Ravi Ramamoorthi, Maneesh Agrawala
XPU
2007
Springer
14 years 2 months ago
Empirical Evidence Principle and Joint Engagement Practice to Introduce XP
Bringing software process change to an organisation is a real challenge. The authors have shown a sample attempt to carry out a process change and then reflected on its results and...
Lech Madeyski, Wojciech Biela
CODES
2008
IEEE
14 years 3 months ago
Speculative DMA for architecturally visible storage in instruction set extensions
Instruction set extensions (ISEs) can accelerate embedded processor performance. Many algorithms for ISE generation have shown good potential; some of them have recently been expa...
Theo Kluter, Philip Brisk, Paolo Ienne, Edoardo Ch...
CASES
2005
ACM
13 years 10 months ago
An Esterel processor with full preemption support and its worst case reaction time analysis
The concurrent synchronous language Esterel allows proto treat reactive systems in an abstract, concise manner. An Esterel program is typically first translated into other, non-s...
Xin Li, Jan Lukoschus, Marian Boldt, Michael Harde...
JAVA
1999
Springer
14 years 26 days ago
Performance Measurement of Dynamically Compiled Java Executions
CT With the development of dynamic compilers for Java, Java’s performance promises to rival that of equivalent C/C++ binary executions. This should ensure that Java will become t...
Tia Newhall, Barton P. Miller