Sign inSign in
ConceptAI & ML

Huffman coding

An entropy encoding algorithm that uses shorter bit strings for more common inputs and longer bit strings for less common inputs.
as Marc Levoy defines itStanford UniversityThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

3

Each in their own terms, from the easiest level.

  • Ankur Moitra

    MIT · Undergraduate

    A greedy algorithm that generates an optimal prefix-free code by repeatedly merging the two symbols with the smallest probabilities.
  • Song Han

    Stanford University · Undergraduate

    Assigning variable-length bit codes based on frequency, using more bits for infrequent weights and fewer bits for frequent weights.
    • 17:45Efficient Methods and Hardware for Deep Learning

Connections

7

The lectures that define it or assume it, and the concepts next to it.

3 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.