Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
A universal data compression algorithm is described which is capable of compressing long strings generated by a “finitely generated” source, with a near optimum per symbol length without prior knowledge of the source. This class of sources may be viewed as a generalization of Markov sources to random fields. Moreover, the algorithm does not require a working storage much larger than that needed to describe the source generating parameters. © 1983 IEEE
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Preeti Malakar, Thomas George, et al.
SC 2012
Ziyang Liu, Sivaramakrishnan Natarajan, et al.
VLDB