| I. H. Witten, A. Mo#at, and T. Bell, Managing Gigabytes. NY: Van Nostrand Reinhold, 1994. |
.... has been theoretically proven optimal and has been applied in data compression and prefetching [Cleary84, Krishnan94, Kroeger96, Moffat90, Vitter91 ] Indeed, it usually outperforms the Lempel Ziv algorithm (found in Unix compress) due to implementation considerations and a faster convergence rate [Curewitz93, Bell90, Witten94]. As described above, the PPM algorithm for text compression consists of a predictor to estimate probabilities for characters and an arithmetic coder. We only make use of the predictor. We encode the outcomes of a branch, taken or not taken, as 1 or 0 respectively. Then the PPM predictor is used ....
Witten I. H., Moffat, A. and Bell T. C. Managing Gigabyres. New York, NY: Van Nostrand Reinhold, 1994.
.... algorithm that has been theoretically proven optimal in data compression and prefetching [Cleary84, Krishnan94, Moffat90, Vitter91] Indeed, it usually outperforms the Lempel Ziv algorithm (found in Unix compress) due to implementation considerations and faster convergence rate [Curewitz93, Bell90, Witten94]. The PPM algorithm for text compression consists of a predictor to estimate probabilities for characters and an arithmetic encoder. We only make use of the predictor. We encode the outcomes of a branch, taken or not taken, as a 1 or a 0. Then the PPM predictor is used to predict the value of the ....
Witten I.H., Moffat, A. and Bell T.C. Managing Gigabytes. New York, NY: Van Nostrand Reinhold, 1994.
No context found.
I. H. Witten, A. Mo#at, and T. Bell, Managing Gigabytes. NY: Van Nostrand Reinhold, 1994.
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