### Table 3: Cell- and area-based parallelization

### Table 1. Algorithms under study

2006

"... In PAGE 4: ... For this paper, we have selected a representative set of algorithms from each class of RF fingerprinting schemes for conducting our analysis. The algorithms we have selected are presented in Table1 . Although there are a variety of other fingerprinting localization algorithms that may be studied, our results are general and can be applied to other point-based and area-based methods.... ..."

Cited by 3

### Table 1. Example Rule Set

"... In PAGE 2: ... RELATED WORKS 2.1 2-dimensional Search Trie Table1 shows an example rule set. We will discuss the area-based quad-trie and the proposed algorithm using this example rule set.... In PAGE 2: ... Each partitioned area is represented by two n-bit prefixes which are source and destination prefixes. Figure 1 shows the AQT plane corresponding to the example rule set in Table1 . Rules are represented by rectangles in the AQT plane.... In PAGE 4: ... Hence the number of decomposed tries is bounded by a small number in packet classification. Figure 4 shows the proposed binary search on length (BSL) trie architecture for the example rule set in Table1 . Since there are maximum 3 levels of rule nesting as shown in Figure 2, we have three separated BSL tries.... ..."

### Table 1. Comparison of results between grids with and without diagonals. New results

1994

"... In PAGE 2: ... For two-dimensional n n meshes without diagonals 1-1 problems have been studied for more than twenty years. The so far fastest solutions for 1-1 problems and for h-h problems with small h 9 are summarized in Table1 . In that table we also present our new results on grids with diagonals and compare them with those for grids without diagonals.... ..."

Cited by 11

### Table 1{Performance bounds for zero propagation delay algorithms Class of Scheduling Range of Property P3 Property P2 Property P1 Algorithms Throughput k N k

1997

"... In PAGE 13: ...3 For gt; 12, S 6, and n 3, no scheduling algorithm in the class CONTIN- UOUS STATIC has any property P1{P4. Table1 summarizes the throughput and delay characteristics of the scheduling algorithms pre- sented in this and the previous section. The last three columns list the upper bounds for k N k,... ..."

Cited by 45

### Table 2. Speedup in Worst-Case Execution Time for Optimized Virtual Table Algorithm

"... In PAGE 5: ... However, for the OVTA, the optimiza- tion over VTA depends completely on the characteristics of the generator polynomial chosen. Table2 shows the improvement over the VTA for several different polyno- mials (refer to Section 4 for a description of CRC32sub8 and CRC32sub16) . Note that for the particular CRC24 and CRC32 polynomials we used for our experiments, the OVTA has no improvement at all over the VTA.... ..."

### TABLE l Parameter values fitted by the optimization algorithms for the test problem*

1976

### Table 4.19: Comparison of the Pnc 2 with the Rise algorithm

### Table 7. Estimate Breaks in Variance by the ICSS, and Apply to the Absolute Stock Returns

1999

"... In PAGE 21: ... To avoid this problem, we use the ICSS method to identify breaks in variances of stock returns by using the model (19) - (21). Table7 reports the number of sudden changes in variance as identified by the ICSS algorithm for stock returns. Periods 3 and 7 have 17 break points and period 9 has only 4 change points and so on.... In PAGE 21: ... The significant changes in variance are a little bit more than those in level of absolute returns. The 3rd panel of Table7 shows the results of fitting breaks that correspond to the points of breaks in variance to the level of absolute stock returns. When breaks in variance are introduced, the evidence is somewhat mixed.... ..."

Cited by 19