Between Dynamic Programming and Greedy: Data Compression

Between Dynamic Programming and Greedy: Data Compression (1995)

Cached

Download Links

[www.comlab.ox.ac.uk]

by Richard S. Bird , Oege De Moor

Venue:	Programming Research Group, 11 Keble Road, Oxford OX1 3QD
Citations:	5 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Between Dynamic Programming and Greedy: Data Compression	user correction - Legacy Corrections
AUTHOR NAME	Richard S. Bird	SVM HeaderParse 0.1
AUTHOR AFFIL	Oxford University Programming Research Group	SVM HeaderParse 0.2
AUTHOR ADDR	11 Keble Road, Oxford OX1 3QD	SVM HeaderParse 0.1
AUTHOR NAME	Oege De Moor	SVM HeaderParse 0.1
AUTHOR AFFIL	Oxford University Programming Research Group	SVM HeaderParse 0.2
AUTHOR ADDR	11 Keble Road, Oxford OX1 3QD	SVM HeaderParse 0.1
ABSTRACT	The derivation of certain algorithms can be seen as a hybrid form of dynamic programming and the greedy paradigm. We present a generic theorem about such algorithms, and show how it can be applied to the derivation of an algorithm for data compression. 1 Introduction Dynamic programming is a technique for solving optimisation problems. A typical dynamic programming algorithm proceeds by decomposing the input in all possible ways, recursively solving the subproblems, and combining optimal solutions to subproblems into an optimal solution for the whole problem. The greedy paradigm is also a technique for solving optimisation problems and differs from dynamic programming in that only one decomposition of the input is considered. Such a decomposition is usually chosen to maximise some objective function, and this explains the term `greedy'. In our earlier work, we have characterised the use of dynamic programming and the greedy paradigm, using the categorical calculus of relations to der...	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
VENUE	Programming Research Group, 11 Keble Road, Oxford OX1 3QD	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
VOLUME	11	INFERENCE
CITATIONS	24 found	ParsCit 1.0