| Reif, J.H. and Storer, J.A. (1997) "Optimal lossless compression of a class of dynamic sources." Proc Data Compression Conference, edited by J.A. Storer and J.H. |
....an approximately constant level. Our choice of 19 training documents for all other tests seems to be a sensible one. 5. LOCATING TOKENS IN CONTEXT We locate tokens in context by considering the input as an interleaved string of information from different sources. This model has been studied by Reif and Storer (1997), who consider optimal lossless compression of nonstationary sources produced by concatenating finite strings from different sources. However, they assume that the individual strings are long, and grow without bound as the input increases; this assumption allows an encoding method to be derived ....
Reif, J.H. and Storer, J.A. (1997) "Optimal lossless compression of a class of dynamic sources." Proc Data Compression Conference, edited by J.A. Storer and J.H.
....Figure 3 Effect of model order on token identification (light areas represent tokens mis identified as plain text) 4 Locating tokens in context We locate tokens in context by considering the input as an interleaved string of information from different sources. This model has been studied by Reif and Storer (1997), who consider optimal lossless compression of non stationary sources produced by concatenating finite strings from different sources. However, they assume that the individual strings are long, and grow without bound as the input increases; this assumption allows an encoding method to be derived ....
Reif, J.H. and Storer, J.A. (1997) "Optimal lossless compression of a class of dynamic sources." Proc Data Compression Conference, edited by J.A. Storer and J.H. Reif. IEEE Computer Society Press, Los Alamitos, CA, pp. 501--510.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC