Conference paper
Hybrid reinforcement learning with expert state sequences
Xiaoxiao Guo, Shiyu Chang, et al.
AAAI 2019
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
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.
Fearghal O'Donncha, Albert Akhriev, et al.
Big Data 2021
Conference paper
Program equivalence and context-free grammars
Barry K. Rosen
SWAT 1972