Comments on: An “Adaptive” Move-to-Front Algorithm http://coder.bsimmons.name/blog/2009/11/an-adaptive-move-to-front-algorithm/ fragmentary ideas ䷿ intellectual what-nots ䷷ and haskell programming ䷴ Thu, 22 Jul 2010 21:36:05 +0000 http://wordpress.org/?v=2.9.1 hourly 1 By: jberryman http://coder.bsimmons.name/blog/2009/11/an-adaptive-move-to-front-algorithm/comment-page-1/#comment-172 jberryman Sun, 15 Nov 2009 22:04:46 +0000 http://coder.bsimmons.name/blog/?p=273#comment-172 Steve, thanks for commenting. I just checked out the BSTW algorithm, and what I invented above is exactly that, except that as you stated each new symbol that is encoded is followed by its symbol in the output stream, rather than storing the final permutation of the symbol dictionary separately. I'll update the post with this info. Thanks for pointing that out! Steve, thanks for commenting. I just checked out the BSTW algorithm, and what I invented above is exactly that, except that as you stated each new symbol that is encoded is followed by its symbol in the output stream, rather than storing the final permutation of the symbol dictionary separately.

I’ll update the post with this info. Thanks for pointing that out!

]]> By: Steve http://coder.bsimmons.name/blog/2009/11/an-adaptive-move-to-front-algorithm/comment-page-1/#comment-171 Steve Sun, 15 Nov 2009 21:21:37 +0000 http://coder.bsimmons.name/blog/?p=273#comment-171 It's a bit different, and I'm not sure if you've heard of it, but I encountered another adaptive move-to-front algorithm which is used as part of Algorithm BSTW. If a symbol has not yet been encoded, they output the N+1 followed by the symbol (where N is the number of unique symbols encoded so far). It’s a bit different, and I’m not sure if you’ve heard of it, but I encountered another adaptive move-to-front algorithm which is used as part of Algorithm BSTW. If a symbol has not yet been encoded, they output the N+1 followed by the symbol (where N is the number of unique symbols encoded so far).

]]>