### Table 2: Average frame rate using different resolutions and shadow volume methods: For high resolutions the computation of the shadow mask in the alpha or screen buffer was slightly faster than using the stencil buffer. Computing the shadow mask at half the screen resolution improved the performance for higher window resolutions.

2002

"... In PAGE 6: ... In particular, the minimum frame rate is in- creased by almost a factor of four. 5 Results Table2 shows the average frame rate achieved by our algorithms during an animation of the scene shown in Figure 6. The test was performed on a AMD 800MHz PC with a NVIDIA GeForce 2 MX graphics card.... ..."

Cited by 1

### Table III. Monitor interference on FFT polynomial multiplication

### Table 6: FFT

1997

"... In PAGE 7: ...( Performance Level: good means speedups 8, medium means speedups 5, and poor means speedups lt; 5). However, for FFT, ne granularity multiples the number of read misses due to lack of prefetching (see Table6 ). Conse- quently, the overall performance for FFT decreases.... ..."

Cited by 47

### Table Diffraction

in Remote Controlled Experiments for Teaching over the Internet: A Comparison of Approaches Developed

2002

Cited by 3

### TABLE I ENERGY DISSIPATION OF THE FFT AND MATRIX MULTIPLICATION SOFTWARE PROGRAMS

2004

Cited by 3

### Table A.5: 1D CMSSL FFT, Multiple simultaneously FFTs.

### Table A.6: 1D CMSSL FFT, Multiple simultaneously FFTs.

### Table A.7: 1D CMSSL FFT, Multiple simultaneously FFTs.

### Table 6: Energy dissipation for FFT and matrixmultiplication on PowerPC (300MHz) FFT (300MHz) Matrix Multiplication (300MHz)

"... In PAGE 10: ...9mW/MHzand a clockfrequency of 300 MHz, as described above. The re- sults are shown in Table6 with the lower bounds obtained from Section 4. The constant factor is relatively high in Pow- erPC designs due to the fact that very rough estimates that ignore all types of instructions but arithmetic instructions are used.... ..."