Michael Hersche, Mustafa Zeqiri, et al.
NeSy 2023
Paper
Linear Algorithm for Data Compression via String Matching
Abstract
A linear implementation of the optimal universal data compression methods of Lempel and Ziv is described. The main tool is McCreight's algorithm for constructing suffix trees. Both bounded and unbounded memory are considered. © 1981, ACM. All rights reserved.
Related
Shyam Marjit, Harshit Singh, et al.
WACV 2025
Yehuda Naveli, Michal Rimon, et al.
AAAI/IAAI 2006
Conference paper
Representing and Reasoning with Defaults for Learning Agents
Benjamin N. Grosof
AAAI-SS 1993