✦ LIBER ✦

A fast algorithm for Huffman decoding based on a recursion Huffman tree

✍ Scribed by Yih-Kai Lin; Shu-Chien Huang; Cheng-Hsing Yang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

High speed pattern matching for a fast H

✍ Seung Bae Choi; Moon Ho Lee 📂 Article 📅 1995 🏛 IEEE 🌐 English ⚖ 527 KB

A fast multi-objective evolutionary algo

✍ Chuan Shi; Zhenyu Yan; Zhongzhi Shi; Lei Zhang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 716 KB

A trellis-based recursive maximum-likeli

✍ Fujiwara, T.; Yamamoto, H.; Kasami, T.; Shu Lin 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 714 KB

A fast nearest-neighbor algorithm based

✍ McNames, J. 📂 Article 📅 2001 🏛 IEEE 🌐 English ⚖ 627 KB

Fast and versatile algorithm for nearest

✍ Yong-Sheng Chen; Yi-Ping Hung; Ting-Fang Yen; Chiou-Shann Fuh 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 431 KB

A fast algorithm for image reconstructio

✍ Zhongke Yin; Jianying Wang; Pierre Vandergheynst 📂 Article 📅 2007 🏛 SP Higher Education Press 🌐 English ⚖ 162 KB