Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask

Comment on

( #3333=superdoc: print w/replies, xml ) Need Help??
I feel like this should be an episode of Doctor Who with incongruent time lines.

At the time I responded to the clarification of what I meant by inversely proportional, I had already moved on from thinking it was an appropriate solution. I only clarified for the sake of completeness. What I should have said was something along the lines of:

Not that it matters since I now realize it does not solve my problem but there is a difference between having an inverse relationship and being inversly proportional. The idea that the more popular an animal is the fewer questions it should take to identify is an inverse relationship. When I said inversly proportional I meant that the product of popularity to questions should be a constant defining exactly how many questions should be asked. In the end, I was wrong.

As for what I am trying to achieve - I am attempting to build on top of Huffman coding. Let's say you have a file that you have done single byte frequency analysis on and generated a Huffman code tree. You notice that a few of the branches only have 1 leaf entry instead of 2. You decide you want to fill in those "holes" with with the highest frequency 2 byte pairs in the file. You fill in the first hole but before moving on to the next one, you realize a problem. The frequency analysis of the single bytes requires recalculating which means rebuilding the tree which means different holes.

I am not sure if that makes any more sense. I took the weekend off from thinking about it in hopes that I would have clarity today but it is still a jumbled pile of mud in my mind.

Cheers - L~R

In reply to Re^6: Challenge: Optimal Animals/Pangolins Strategy by Limbic~Region
in thread Challenge: Optimal Animals/Pangolins Strategy by Limbic~Region

Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":

  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.
  • Log In?

    What's my password?
    Create A New User
    and all is quiet...

    How do I use this? | Other CB clients
    Other Users?
    Others taking refuge in the Monastery: (5)
    As of 2018-03-23 19:08 GMT
    Find Nodes?
      Voting Booth?
      When I think of a mole I think of:

      Results (296 votes). Check out past polls.