### Table 1. Execution times of different algorithms for certain quality levels

"... In PAGE 6: ... Experimental Results To evaluate the QoS optimiser and to reflect the broad spectrum of different operator behaviours we implemented five different algorithms for dynamic image retrieval. Table1 shows the execution times at different quality levels. The utilities represent two linear, an exponential, a logarithmic and a constant time increase when the quality is increased.... In PAGE 6: ... Less than five would be a too rough classification in the users view and more than five levels makes it difficult to imagine the significance between two levels. Table1 also lists the overhead for each algorithm. That overhead occurs whenever its quality level is altered at run-time.... ..."

### Table 4: Validation of the statistical significance es- timations: Number of conclusions drawn at a certain level and accuracy of the conclusions.

"... In PAGE 7: ...2 Other Significance Levels While the 95% statistical significance level is the most commonly used for historical reasons, we want to validate as well the accuracy of the boot- strap resampling method at different statistical sig- nificance levels. Table4 displays our findings. For each con- clusion, we check into what statistical significance range it falls, e.... ..."

### Table 4: Validation of the statistical significance es- timations: Number of conclusions drawn at a certain level and accuracy of the conclusions.

"... In PAGE 7: ...2 Other Significance Levels While the 95% statistical significance level is the most commonly used for historical reasons, we want to validate as well the accuracy of the boot- strap resampling method at different statistical sig- nificance levels. Table4 displays our findings. For each con- clusion, we check into what statistical significance range it falls, e.... ..."

### Table 1: The number of loops with a certain nesting level. Level Global count Local count Scope count

2004

Cited by 4

### Table 1: The number of loops with a certain nesting level. Level Global count Local count Scope count

2004

Cited by 4

### Table 1: The number of loops with a certain nesting level. Level Global count Local count Scope count

2004

"... In PAGE 17: ... Pulse Code Modulation G.721 Speech encoding and decoding, reference implementation of the CCITT Multi Sort Combination of sorting algorithms Table1 : Benchmarks 0 16 32 64 128 256 512 1024 2048 4096 0 250 500 750 1000 1250 1500 1750 2000 2250 2500 2750 3000 3250 3500 3750 4000 Execution Time vs. WCET (G.... In PAGE 25: ... 4.1 Multiple process execution Table1 presents the response time for different cache architectures and benchmarks in terms of clock cycles. A 2-way associative 1024 Byte cache with 8 Byte block size is denoted as 1024-8-2.... ..."

### Table II: The usage of different access strategies (in % of all usage) at tasks with a certain level of experience. (Abbreviations used: RB - Restricted Browsing view type; FB - Free Browsing. )

### Table 3: Types of ontogenic relations identified in the Beethoven sample Level Relation Certain

1998

"... In PAGE 17: ... In 128 cases the original EXPRESSION was not in our sample, and so we generated new EXPRESSIONs including whatever is known about the predecessors. Table3 lists the frequency of the different types of ontogenic relations identified. All certain relations are also considered tentative relations: the semantics is that we know, with at least that level of certainty, that the relation holds.... ..."

Cited by 3

### TABLE 2. Hecke eigenvalues ap for Hecke operators Ep, with 2 p 173, of eigenforms of certain levels. For each column of the table we x an algebraic integer with the following property: 2 = ?2; 2 = ?3; 2 = ?7; 2 = ?11; quot;2 = ?15; 2 = ?23:

### Table 3: The probability that a certain working set tran- sition will occur on level i.

2000

"... In PAGE 4: ... On the other hand, if Hi is high, as when index scan is used, the relative frequency of WST2 will be high. In Table3 the equations for the relative frequencies are tabulated. For example, the probability that a WST1 occurs at level 1 for a sequential scan is the probability that a match does not occur and there is another tuple to scan.... ..."

Cited by 9