Sciweavers

7123 search results - page 381 / 1425
» The Ordered Set of Rough Sets
Sort
View
184
Voted
RT
1997
Springer
15 years 11 months ago
An Empirical Comparison of Progressive and Wavelet Radiosity
Abstract. This paper presents a comparison of basic progressive and wavelet radiosity algorithms. Several variants of each algorithm were run on a set of scenes at several paramete...
Andrew J. Willmott, Paul S. Heckbert
POPL
1994
ACM
15 years 11 months ago
Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages
This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: n...
Koenraad De Bosschere, Saumya K. Debray, David Gud...
ASPDAC
2007
ACM
101views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Core-Based Testing of Multiprocessor System-on-Chips Utilizing Hierarchical Functional Buses
Abstract--An integrated test scheduling methodology for multiprocessor System-on-Chips (SOC) utilizing the functional buses for test data delivery is described. The proposed method...
Fawnizu Azmadi Hussin, Tomokazu Yoneda, Alex Orail...
CASES
2004
ACM
15 years 10 months ago
Scalable custom instructions identification for instruction-set extensible processors
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
Pan Yu, Tulika Mitra
CCS
2006
ACM
15 years 10 months ago
Provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Fe...