### Table 1: Classical and quantum error correction

"... In PAGE 12: ... The commonest situation is that when C has minimum weight at least d, when E consists of all words of weight at most b(d ? 1)=2c. Table1 compares the situation in the classical and quantum cases.... ..."

### Table 7. Intermediate methods for the classical Cantor set.

"... In PAGE 17: ...scillate. It is probable that this is due to cumulative rounding errors. The matrix size is very large for these values of n, and double precision cannot guarantee more than 15 correct digits. Noting that the numbers in Table7 all have 15 digits, we conclude that we have reached the hardware precision in this example. It makes little sense to extrapolate the last two columns.... ..."

### Table 1. Comparison of quantum vs. classical separations for query problems in the bounded-error model.

2000

Cited by 10

### Table 1. Differences in performance from pretest to posttest

2003

Cited by 1

### Table 1: Table of errors E#28N; quot;; #0B#29 for the classical scheme

in Discrete approximations for singularly perturbed boundary value problems with parabolic layers, II

1996

"... In PAGE 10: ...he approximation of #286.12#29 we #0Crst use the classical scheme #283.5#29,#284.8#29. We solve the problem for di#0Berentvalues of the mesh width h 1 = h 2 = N ,1 and for di#0Berentvalues of the parameters quot; and #0B. The results for a set of numerical experiments is given in Table1 . From Table 1 we can see that the solution of scheme #283.... ..."

Cited by 15

### Table 1. Three situations of errors correction.

"... In PAGE 4: ... Whenever text input evaluation involves corrections, human factors must be considered because we cannot predict how the user will correct the errors. For example, in Table1 there are three situations, but only situation S0 lends itself to automatic experiments because there is no concern about corrections. In character-based text entry, if we assume that the same number of errors occur in different situations and users adopt the same method to fix the problems, we would still need to design a keystroke event logger to record all the editing processes in order to determine the boundary of the amortized cost: .... ..."

### Table 2. An Error Correcting Codes (ECC) Matrix

"... In PAGE 7: ... Dynamic Fusion Problem Viewed as a Factorial Hidden Markov Model (FHMM) We also define the ECC matrix ECC = [emn] as the diagnostic matrix (D-matrix), which represents the full-order dependency among failure sources and classifiers. Table2 shows an ECC matrix as an illustrative example (8 failure sources and 4 classifiers). Table 2.... ..."

### Table 3: A 15-bit error-correcting output code for a ten-class problem.

1995

"... In PAGE 4: ... Table3 shows a 15-bit error-correcting code for the digit-recognition task. Each class is represented byacodeword drawn from an error-correcting code.... In PAGE 4: ... If we make only b d,1 2 c errors, the nearest codeword will still be the correct codeword. #28The code of Table3 has minimum Hamming distance seven and hence it can correct errors in any three bit positions.#29 The Hamming distance between anytwo codewords in the one- per-class code is two, so the one-per-class encoding of the k output classes cannot correct any errors.... In PAGE 7: ... 2.3 Error-Correcting Code Design We de#0Cne an error-correcting code to be a matrix of binary values such as the matrix shown in Table3 . The length of a code is the number of columns in the code.... ..."

Cited by 353