### TABLE I CRYPTOGRAPHIC COMPUTATION PROCESSING TIME

### Table 4: Actual demand for computational processes (cp) in the result 3 runs.

### Table 1. Computational times of processes in generating isosurfaces.

"... In PAGE 1: ... The above-mentioned algorithms have drastically reduced the unnecessary cost of visiting non-isosurface cells. Table1 shows the cost of generating 20 isosurfaces with different iso-values in an unstructured volume consisting of tetrahedral cells. The experimental test compares a straightforward algorithm (ST) that visits all cells and... In PAGE 2: ... Though it would be possible to implement the isosurfacing algorithm without the polygon- vertex identification process, the process is desirable, because it reduces the amount of polygon-vertex data calculation and the memory-space. In Table1 , the number of vertices v N would be 3 t N --- about six times greater --- without the identification process. In this case, the computational time 3 T would be greater than the polygon construction time 2 T , and the memory-space would be about three times greater.... ..."

### Table 1: Computational tasks of the Processing Ele-

2001

Cited by 1

### Table 3: Computation time for the selection process.

2002

"... In PAGE 6: ...5 hours. The selection method used here is the basic one (Method 1), and the computation time required for various excerpt duration is shown in Table3 . It is interesting to note that, thanks to the implementation of a greedy selection mecha- nism, computation time increase sublinearly.... ..."

### Table 3: Computation times for the whole simulation process.

1999

"... In PAGE 2: ... This requirement triggered a series of new algorithmic developments to be reported here, among which is an adaptive multilevel FEM for Maxwell apos;s equations, which dominates the numerical simulation time. In total, however, the main bulk of computation time (see Table3 in Section 4 below) still goes into segmentation { a necessary preprocessing step in the construction a 3D virtual patient from the input of a stack of 2D computed tomograms (left out here). 1supported by Deutsche Forschungsgemeinschaft, Sonderforschungsbereich 273... In PAGE 10: ... In what follows we document some comparative results for both the old and the new applicator. Table3 shows the computation times for the whole simulation process, based on the linear BHT as heat transfer model. Note that... ..."

Cited by 1

### Table 3. The computation time of processes in 10-PE example

### Table 1: Performance impact of extending the quantum for a computationally intensive process.

### Table 1: Computing the Current Consumption of the Individual Processes

"... In PAGE 3: ...ontinuously report of the power consumption. Fig. 3.c illustrates the lower DRAM power consumption when using reduced board frequency. Table1 shows the typical current consumption obtained with our tool using different process mixtures. In the first line we have listed the base-line current which is obtained when turning off all the processes.... In PAGE 3: ... The 35mA reading is therefore the current consumption overhead of the SoC effort in communicating with the PC, running the current measurement process, and performing other standby functions. This value is subtracted from all the subsequent readings of Table1 to obtain the net process currents. Thus the second row shows the 22mA net current reading for the LED (fixed load) obtained by subtracting the base line current of 35mA from the 57mA overall reading.... ..."

### Table 1. Business Processes Information and Computer

"... In PAGE 2: ... Table1... ..."