✦ LIBER ✦

High speed pattern matching for a fast Huffman decoder

✍ Scribed by Seung Bae Choi; Moon Ho Lee

Book ID: 117870736
Publisher: IEEE
Year: 1995
Tongue: English
Weight: 527 KB
Volume: 41
Category: Article
ISSN: 0098-3063
DOI: 10.1109/30.370315

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for Huffman decoding ba

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

✍ Yih-Kai Lin; Shu-Chien Huang; Cheng-Hsing Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 386 KB

ALTEP— A cellular processor for high-spe

ALTEP— A cellular processor for high-speed pattern matching

✍ Dik Lun Lee 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 930 KB

A novel high-speed neural model for fast

A novel high-speed neural model for fast pattern recognition

✍ Hazem M. El-Bakry 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 593 KB

Pattern Matching Machine implementation

Pattern Matching Machine implementation of a fast test for unique decipherability

✍ A. Apostolico; R. Giancarlo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 315 KB

A class of high-speed decoders for linea

A class of high-speed decoders for linear cyclic binary codes

✍ Ehrich, R.; Yau, S. 📂 Article 📅 1969 🏛 IEEE 🌐 English ⚖ 689 KB

Rete: A fast algorithm for the many patt

Rete: A fast algorithm for the many pattern/many object pattern match problem

✍ Charles L. Forgy 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 982 KB

The Rete Match Algorithm is an efficient method for comparing a large collection of patterns to a large collection of objects. It finds all the objects that match each pattern. The algorithm was developed for use in production system interpreters, and it has been used for systems containing from a f