### Table 8. Significant correlations with respect to BP, BK, and BC.

"... In PAGE 12: ... We also added a parame- ter called the Best Performance (BP) value where the largest increase in classification accuracy occurred (one of the iterations), and its associated parameters best K (BK) and C (BC) values. Table8 shows the correlation values that were significant. In general, as previously shown in Section 4.... ..."

### Table 3. Values of C6 C8BK

2002

"... In PAGE 6: ... whole macroblock will be padded for BFBE BY D2 A1 B4C6 C8BK D2 B7 C6 C8BDBI D2 B5 [s]. We can formulate the Processing speed of the ALU as follows: C8D6D3CRCTD7D7CXD2CV D7D4CTCTCS AP BY D2 BFBE A1 B4C6 C8BK D2 B7 C6 C8BDBI D2 B5 CJC5BUBPD7CL (3) Assuming a realistic value of BY D2 BP BDBZC0DE and using the data from Table3 into Equation 3, we calculated the processing speed results, given in Table 4. Table 4.... ..."

Cited by 1

### Table 1. Measuring the e ect of bk-class

1992

"... In PAGE 9: ... 2, we have measured the number of backtracking points required to generate di erent clauses conveying the same core content. Table1 sum- marizes these measurements.7 Table 1.... ..."

Cited by 44

### Table 3 Vectors D9CX for the construction of Householder building blocks. C5 BP BK; BW BP C1BK.

1999

"... In PAGE 3: ... The best performance for C5 BP BK is given in Figure 1(e), which depicts the result for an implementation via Householder building blocks. The vectors D9CX used to construct these blocks are listed in Table3 . Their elements are small integers, allowing an efficient implementation of the modulation in factorized form.... ..."

Cited by 2

### Table4. Expression of Problem Seyfert-filter. BK

1930

Cited by 7

### Table 2: Efficiency of the Lagrange optimization procedure for BU BPBIand BK.

2004

"... In PAGE 18: ... In the absence of an analytical expression for the number of iterations required to arrive at a solution, we demonstrate the efficiency of the proposed procedure empirically. In Table2 , we list the total number D4 BU B4CF B5 of unique TAM partitions for a total TAM width of CF and for BU TAMs. The value of D4 BU B4CF B5 is calculated using the expression D4 BU B4CF B5 BP CF BUA0BD BUAXB4BUA0BDB5AX [12].... ..."

Cited by 4

### Table 4: The Link Blocking Probabilities Bk ij for the 3-node Network

### Table 6: The Network Blocking Probabilities e Bk for the 3-node Network

### Table 9: The Link Blocking Probabilities Bk ij in the 5-node Network

### Table 3: Upper bounds on (fk) ? (bk) obtained from the TSE algorithm.

"... In PAGE 15: ... This analysis, however, does not indicate whether or not our production line will operate correctly given the temporal constraint which must be observed. Table3 summarizes the results of the TSE algorithm which is used to determine an upper bound on the maximum separation in time between b and f, i.e.... ..."