[Haskell-cafe] Toy compression algorithms
Bulat Ziganshin
bulat.ziganshin at gmail.com
Fri Jul 13 00:59:15 EDT 2007
Hello Andrew,
Thursday, July 12, 2007, 10:06:52 PM, you wrote:
> The idea behind PPM is very simple and intuitive. But working out all
> the probabilities such that they always sum to 100% is surprisingly
> hard. :-(
why? you just add probabilities of all symbols in this context and add
1 for escape symbol
--
Best regards,
Bulat mailto:Bulat.Ziganshin at gmail.com
More information about the Haskell-Cafe
mailing list