Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
233,160
Table 3. Parameters for improved forgery attack on MAA. Attacks with lt; 256 zero blocks avoid the `long message mode apos; (see x4.4).
"... In PAGE 11: ... In this case must exceed 1=4 to avoid interference of the second prime factor (257). An overview of the trade-o s is given in Table3 . These trade-o s are more realistic (cf.... In PAGE 12: ... This thwarts attacks using more than 256 zero blocks, including the forgery attack of Proposition 5 which requires a single chosen text. However, it follows from Table3 that the attack with zero blocks can be done with about 224:7 messages of about 1000 bytes, independent of the special mode. Ironically the basic attack (using Proposition 2) of x4.... ..."
Table 3. Parameters for improved forgery attack on MAA. Attacks with lt; 256 zero blocks avoid the `long message mode apos; (see x4.4). # 0 blocks # chosen texts total size (bytes)
"... In PAGE 11: ... In this case must exceed 1=4 to avoid interference of the second prime factor (257). An overview of the trade-o s is given in Table3 . These trade-o s are more realistic (cf.... In PAGE 12: ... This thwarts attacks using more than 256 zero blocks, including the forgery attack of Proposition 5 which requires a single chosen text. However, it follows from Table3 that the attack with zero blocks can be done with about 224:7 messages of about 1000 bytes, independent of the special mode. Ironically the basic attack (using Proposition 2) of x4.... ..."
Table 3. Percentage of all zero blocks at 64 kbits/sec. Fast motion Slow motion
2003
Cited by 4
Table 3-1 Zero-Block Fundamental Sequence Codewords as a Function of the Number of Consecutive All-Zeros Blocks .......................................................................................... 3-5 5-1 Decoding Logic for the Second-Extension Option ........................................................... 5-4 6-1 Summary of Data Compression Performance for Different Scientific Data Sets............. 6-2
Table 3: Percent reduction in number of calls to the neural network for each test image, using the 4-coefficient context test.
2001
"... In PAGE 13: ... The number of calls to the network without this scheme is fixed at 368,640 (294,912 and 73,728 for wavelet levels 0 and 1, respectively) per image. Table3 shows the percentage reduc- tion in the mean number of calls to the network, over each test image, for wavelet... ..."
Cited by 3
Table 3: Parameters for improved forgery attack on MAA # 0 blocks # chosen texts total size (bytes)
1996
"... In PAGE 10: ...of the third prime factor (257). An overview of the trade-o s is given in Table3 . These trade-o s are more realistic (cf.... In PAGE 10: ... This thwarts attacks using more than 250 zero blocks, including the forgery attack which requires a single chosen text. However, it follows from Table3 that the attack with zero blocks can be done with about 224:7 messages of about 1000 bytes, independent of the special mode. The basic attack of x4.... ..."
Cited by 27
Table IV: Models and coefficient values used to undistort the images
TABLE 6. Percent of L2-cache misses that access a zero block for two different cache sizes. First row: 512K L2-cache per thread. Second row: 4MB L2-cache per thread.
2005
Cited by 3
Table 2: Context models for the quantization data.
1993
"... In PAGE 5: ... The entropy coding scheme can be improved by using an appropriate context for the prediction errors. We consider the models presented in Table2 . Here eai-1 and ebi-1 refers to the prediction errors of the previously coded block (model 2).... ..."
Cited by 1
Table 2 shows an example of the coding order for the quantized coefficients of one
2000
"... In PAGE 9: ... Table2 : Example of Sub-Bitplane Coding Order. All coding is done using context dependent binary arithmetic coding.... ..."
Cited by 44
Results 1 - 10
of
233,160
