[B! information][compression] kenzan8000のブックマーク

kenzan8000 id:kenzan8000

informationとcompressionに関するkenzan8000のブックマーク (2)

Elegant Compression in Text (The L.Z.77 Method) - Computerphile - YouTube
Text compression methods such as LZ can reduce file sizes by up to 80%. Professor Brailsford explains the nuts and bolts of how it is done. Original Compression film: http://youtu.be/Lto-ajuqW3w EXTRA BITS - Text Compression meets probabilities: http://youtu.be/cCDCfoHTsaU Cross Site Scripting with Tom Scott: http://youtu.be/L5l9lSnNMxg http://www.facebook.com/computerphile https://twitter.com/c
kenzan8000 2020/04/23
basic idea of text compression. reuse the character pattern already occurred. use data structure like the pointer and length for the implementation. also, the frequency of word or character pattern fits better than each character does. it is called adaptive compression or arithmetic compression.

computer science

information

compression

data structure

algorithm

statistics
リンク
Upside Down Trees (Huffman Trees) - Computerphile - YouTube
How do we derive the most compact codes for a situation? Huffman Trees can help. Professor Brailsford explains how computer scientists like their trees to be upside down. "Entropy in Compression - Computerphile" precedes this: http://www.youtube.com/watch?v=M5c_RFKVkko EXTRA BITS: More on Huffman Trees: http://www.youtube.com/watch?v=DV8efuB3h2g Error Correction: http://www.youtube.com/watch?v=
kenzan8000 2020/04/23
for entropy reduction. pick up two lower probabilities first as a deepest branch. repeat it until you have built complete binary tree. then you can assign bit codes to each. less bit codes are assigned to frequently used data.

computer science

information

compression

statistics

huffman

tree
リンク
1

お知らせ

もっと読む

公式Twitter

@HatenaBookmark
リリース、障害情報などのサービスのお知らせ
@hatebu
最新の人気エントリーの配信

キーボードショートカット一覧

j次のブックマーク

k前のブックマーク

lあとで読む

eコメント一覧を開く

oページを開く

設定を変更しましたx