Unbounded length contexts for PPM John G. Cleary, W. J. Teahan, Ian H. Witten Department of Computer Science, University of Waikato, New Zealand

First Page		Document Content
Date: 1998-12-21 21:34:37 Data compression Software engineering Trie Video compression Radix tree Lossless data compression Arithmetic coding C Linked list Computing Computer programming Prediction by partial matching		Unbounded length contexts for PPM John G. Cleary, W. J. Teahan, Ian H. Witten Department of Computer Science, University of Waikato, New Zealand Add to Reading List Source URL: www.cs.waikato.ac.nz Download Document from Source Website File Size: 308,72 KB Share Document on Facebook

	Functional Programming for Compiling and Decompiling Computer-Aided Design DocID: 1xW3j - View Document
	Programming with “Big Code”: Lessons, Techniques and Applications Pavol Bielik1 , Veselin Raychev1 , and Martin Vechev1 1 Department of Computer Science, ETH Zurich, Switzerland DocID: 1xVVx - View Document
	A Case for Query-driven Predicate Answer Set Programming (Position Paper) Gopal Gupta Elmer Salazar, Kyle Marple, Zhuo Chen, Farhad Shakerin Department of Computer Science The University of Texas at Dallas DocID: 1xVE0 - View Document
	Science of Computer Programming, 14(2-3), 1990, ppAlgorithm Theories and Design Tactics Douglas R. Smith and Michael R. Lowry Kestrel Institute 3260 Hillview Avenue DocID: 1xVuR - View Document
	A Breadth-First Course in Multicore and Manycore Programming Suzanne Rivoire Sonoma State University Department of Computer Science DocID: 1xTRO - View Document