### Table 1. Number of elementary operations to implement Zech logarithms for an odd characteristic

"... In PAGE 3: ... This table gives the exponent h of any number of the form 1 + gk, so that gh = 1 + gk. Table1 shows the number of elementary operations to implement Zech logarithms for an odd char- acteristic finite field. Only one table of size q is considered.... ..."

### Table 3: Numbers of circulant 2n-graphs, n odd

### Table 3: Numbers of circulant 2n-graphs, n odd

1996

### Table 2. Functions odd(0) and even(0) return true if the number of 0-s in x are odd and even respectively. odd(1) and even(1) are analogously de ned.

1998

"... In PAGE 6: ...nd even respectively. odd(1) and even(1) are analogously de ned. iv) GW2: This function is de ned in Table 2. v) MUH: This function is de ned in Table2 . The global optima is the string of all 0-s while all the strings having a number of trailing 1-s constitute the local optima.... ..."

Cited by 5

### Table VIII. The number of comparators for odd-input sorting networks created using constructors from Table VII.

2005

Cited by 5

### Table 5 Odds Ratio for Two-way Communication as The Number of Messages Increased

"... In PAGE 10: ...A Logistic Regression procedure was conducted to predict the pattern of two- way communication each group would engage as the number of messages increased over time. Table5 shows significant findings in the H+L and N groups. The result indicates that for every one message increase, the H+L group is expected to be 1.... ..."

### Table 1: Comparison of reconstruction quality of video sequences transformed by DCT and ORB-DCT using two descriptions. Re- sults are shown for two cases: a) the odd-numbered description is received, and b) both descriptions are received.

2000

"... In PAGE 3: ... Results along the vertical direction are similar and are not shown. Table1 compares the results for two cases. First, we assume that only the odd-numbered stream of the two descriptions is re- ceived.... In PAGE 4: ...all sequence, the average is 27.49 dB for ORB-DCT and 26.87 dB for DCT. It is interesting to note that under real loss situations, the gain of the new transform for both the missa and football sequences are higher than the synthetic scenario shown in Table1 . This is not surprising because in real tests, we always fed the reconstructed frames that were lost back to the motion-compensation loop, and the improvement of the reconstruction quality due to the new trans- form accrued as the video was played.... ..."

Cited by 2

### Table 1: Comparison of reconstruction quality of video sequences transformed by DCT and ORB-DCT using two descriptions. Re- sults are shown for two cases: a) the odd-numbered description is received, and b) both descriptions are received.

2000

"... In PAGE 3: ... Results along the vertical direction are similar and are not shown. Table1 compares the results for two cases. First, we assume that only the odd-numbered stream of the two descriptions is re- ceived.... In PAGE 4: ...all sequence, the average is 27.49 dB for ORB-DCT and 26.87 dB for DCT. It is interesting to note that under real loss situations, the gain of the new transform for both the missa and football sequences are higher than the synthetic scenario shown in Table1 . This is not surprising because in real tests, we always fed the reconstructed frames that were lost back to the motion-compensation loop, and the improvement of the reconstruction quality due to the new trans- form accrued as the video was played.... ..."

Cited by 2

### Table 1. Conditional output probabilities in parity mapping. statistical neutrality of the parity problem means that it cannot be solved by statistical methods: any process of searching for dependencies between speci c 1 Arguably, since the rule tests for an odd number rather than an even number, the problem should be called the disparity problem.

1996

"... In PAGE 2: ...it (i.e., 3-input) parity problem, which can be written as a training set (using 1=true, 0=false) as follows. x1 x2 x3 y1 1 1 1 =) 1 1 1 0 =) 0 1 0 1 =) 0 1 0 0 =) 1 0 1 1 =) 0 0 1 0 =) 1 0 0 1 =) 1 0 0 0 =) 0 In Table1 we see the unconditional and conditional probabilities for all input- variable instantiations. Note that all the probabilities are exactly the chance value for a boolean value, namely 0.... ..."

Cited by 10