Newsgroups: comp.speech
Path: pavo.csi.cam.ac.uk!pipex!uunet!spool.mu.edu!yale.edu!yale!gumby!destroyer!fmsrl7!lynx!nmsu.edu!opus!ted
From: ted@nmsu.edu (Ted Dunning)
Subject: Re: Dynamic Programming
In-Reply-To: ubacr45@ucl.ac.uk's message of 13 Dec 92 05:05:08 GMT
Message-ID: <TED.92Dec15203555@lole.nmsu.edu>
Sender: usenet@nmsu.edu
Reply-To: ted@nmsu.edu
Organization: Computing Research Lab
References: <Dec.10.00.19.43.1992.7925@caip.rutgers.edu>
	<1992Dec11.155402.17484@eng.cam.ac.uk>
	<1992Dec13.050508.24165@bas-a.bcc.ac.uk>
Date: Wed, 16 Dec 1992 03:35:55 GMT
Lines: 18


In article <1992Dec13.050508.24165@bas-a.bcc.ac.uk> ubacr45@ucl.ac.uk (Mr G Toal) writes:


   I've heard the phrase 'dynamic time warp' bandied around, but your
   description here of dynamic programming is what I thought was dynamic
   time warp.

dynamic time warping is a special instance of dynamic programming.

   (I'd been under the impression that dynamic programming
   was what we used to call in the seventies in AI 'memo functions')

i don't think so.

memo functions could be used to implement some forms of dynamic
programming algorithms, but they do many other things as well.

