Sciweavers

892 search results - page 74 / 179
» Calculating with Requirements
Sort
View
IPPS
2000
IEEE
15 years 5 months ago
Using Time Skewing to Eliminate Idle Time due to Memory Bandwidth and Network Limitations
Time skewing is a compile-time optimization that can provide arbitrarily high cache hit rates for a class of iterative calculations, given a sufficient number of time steps and s...
David Wonnacott
102
Voted
ICNP
1999
IEEE
15 years 5 months ago
Receiver-Cooperative Bandwidth Management for Layered Multicast
In this paper, we propose a receiver-cooperative bandwidth management method for layered multicast streams, considering not only bandwidth requirements but also receivers' pr...
Hirozumi Yamaguchi, Keiichi Yasumoto, Teruo Higash...
WSCG
2003
170views more  WSCG 2003»
15 years 2 months ago
Shading by Spherical Linear Interpolation using De Moivre's Formula
In the classical shading algorithm according to Phong, the normal is interpolated across the scanline, requiring a computationally expensive normalization in the inner loop. In th...
Anders Hast, Tony Barrera, Ewert Bengtsson
84
Voted
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 1 months ago
Efficient Dealiased Convolutions without Padding
Algorithms are developed for calculating dealiased linear convolution sums without the expense of conventional zero-padding or phase-shift techniques. For one-dimensional in-place ...
John C. Bowman, Malcolm Roberts
122
Voted
ENTCS
2008
87views more  ENTCS 2008»
15 years 1 months ago
Remote Attestation on Legacy Operating Systems With Trusted Platform Modules
A lot of progress has been made to secure network communication, e.g., through the use of cryptographic algorithms. However, this offers only a partial solution as long as the com...
Dries Schellekens, Brecht Wyseur, Bart Preneel