### Table 6. Classification of erroneous roots

"... In PAGE 8: ... range of CZ test arguments failures hit rate BD A0 BE BDBK 184925 0 none BE BDBL A0 BE BEBC 370163 3 1 in 123387 BE BEBC A0 BE BEBH 11860787 81 1 in 146429 BE BEBH A0 BE BFBC 379616108 2596 1 in 146231 BE BFBC A0 BE BFBH 12147900900 83659 1 in 145207 BE BFBH A0 BE BGBC 388735554607 2461844 1 in 157904 Table 5. Number of errors found To estimate very roughly the total number of failing cases of minfB4 D4 DCB5 for DC in the fundamental domain, an alternate chart has been constructed in Table6 . Each row counts the number of arguments DC for which the binary rep- resentation of D4 DC has exactly D1 consecutive ones past bit 53, but for which minfB4 D4 DCB5 was computed erroneously.... ..."

### Table 2: Effect of data coding. Reconstruction error, per- centage of erroneously segmented pixels. Voltage signal coding

1999

Cited by 2

### Table 1: Bit E ciency for Interleaved Code One approach to recover loss is introducing redundancy to correct errors. Figure 3 shows the DCT blocks in an image organized into a two-dimensional array. Each row represents a DCT block with 64 frequency components (from 0 to 63), and the number of rows represents the number of DCT blocks in an image. For each DCT block the Hamming code for instance can be used to correct its bit errors. The number of bit errors the Hamming code is able to correct depends on the number of parity bits (the shaded area in the gure) added to the code. Now, in order to deal with bursty errors, the data are sent out by the columns of Figure 3. The data transmission starts from the rst bit (the rst column), second bit (the second column), and so on of each block. If one ATM packet (448 bits) is lost, one may lose only one to two bits in each row (DCT block). The loss can be corrected by the Hamming code. This interleaved code e ectly uses a scheme that is e cient at correcting random bit errors. 6

1998

"... In PAGE 7: ...takes up about 100 bits (since the Hu man code is a variable-rate code, the actual bit number may vary), Table1 lists the number of parity bits needed to correct di erent number of errors. The number of additional bits needed to cover additional errors grows super-linearly.... In PAGE 7: ... The e ectiveness of this interleaved code depends on the degree of redundancy, listed in Table 1. For example, the fth and the sixth rows in Table1 show that correcting a 20% loss rate (20 bits for each 100 bits block) doubles the code length (the total bits over the information bits). If a code is designed for up to 20% loss rate and the actual error rate is higher than 20%, the scheme breaks down.... ..."

Cited by 2

### Table 1 Estimated* arithmetic coding rates (bits/pixel) empirical M = 128 M = 512

1993

"... In PAGE 10: ... Conditioning pixels which fall outside the image can be set to some constant value, say 128. Compression results are summarized for ve Brodatz textures in Table1 , using the masks shown in Figure 1. The numbers are estimates based on PMFs quantized for use with the arithmetic coder, but the actual bit stream was not produced.... ..."

Cited by 56

### Table 1 Estimated* arithmetic coding rates (bits/pixel) empirical M = 128 M = 512

1993

"... In PAGE 10: ... Conditioning pixels which fall outside the image can be set to some constant value, say 128. Compression results are summarized for ve Brodatz textures in Table1 , using the masks shown in Figure 1. The numbers are estimates based on PMFs quantized for use with the arithmetic coder, but the actual bit stream was not produced.... ..."

Cited by 56

### Table 1: average distribution of the erroneous bits

"... In PAGE 4: ... Errors were observed in the CLB, IOB, and BRAM, and in their related interconnections. Table1 summarizes the average error distribution amongst the different kinds of structures, for one campaign example. The number of erroneous bits obtained with a single laser shot can be very large, up to 4497 (137 on average, with a large variance that is also illustrated in Figure 5 by the very different repartitions for four different campaigns).... ..."

### Table 3: Estimated bits per sample for speech data estimation method

2000

"... In PAGE 17: ... 7.1 Comparing e ciencies of representations Table3 shows the estimated number of bits per sample to encode a speech segment to a precision of 1 bit out of 8 ( x = 1=256 of the amplitude range). The table shows the estimated coding costs using the probability of the data (equation 11) and using the entropy, computed by summing the individual entropy estimates of all coe cients (equation 13) (total).... ..."

Cited by 145

### Table 3: Recovered shape information.

2001

"... In PAGE 8: ... Table 1 lists the four weighting coefficients for calculating the local cost function associated with each vertex using equation (1). Table 2 and Table3 summarize the statistics of the examples. In particular, Table 2 summarizes the information of the input data, including data type and the data size.... In PAGE 8: ... In particular, Table 2 summarizes the information of the input data, including data type and the data size. Table3 gives the information of the recovered shape, such as the number of vertices, edges and faces for each model, the running time, and the maximum fitting error. The running time is measured on an AMD K6 475MHZ Notebook PC with 64MB internal memory.... ..."

Cited by 8

### Table 3: Recovered model information.

"... In PAGE 8: ...henever a collision is detected (Fig. 9(d)). Table 1 lists the four weighting coefficients for calculating the local cost function associated with each vertex using Equation (1). Table 2 and Table3 summarize the statistics of our examples. In particular, Table 2 is the input of three dimensions of the volumetric image data.... In PAGE 8: ... In particular, Table 2 is the input of three dimensions of the volumetric image data. Table3 lists the size of recovered shape of the model along with the maximum fitting error of each model. Currently, several parameters need to be set by the user at the start of the deformation process.... ..."

### Table 3 Rates of Gross Omissions and Erroneous Enumerations,

"... In PAGE 2: ... This is show n affo rdable housing. Each slot in these households wa s dr amatically in Table3 , which presents estimates o f all ocated by money, so relationships were ephemeral . gross omission and erroneous enumeration rates base d Information was difficult to obtain because persons living on the ethnographic sample.... In PAGE 3: ...Table3... ..."