Newsgroups: comp.ai
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!news.sprintlink.net!pipex!uunet!munnari.oz.au!cs.mu.OZ.AU!sandy
From: sandy@cs.mu.OZ.AU (Sandy Dance)
Subject: Top-down and bottom-up search space size ref. request
Message-ID: <9431114.26951@mulga.cs.mu.OZ.AU>
Originator: sandy@donatello.vis.mu.OZ.AU
Sender: news@cs.mu.OZ.AU
Reply-To: sandy@cs.mu.OZ.AU (Sandy Dance)
Organization: Computer Science, University Of Melbourne, Australia
Date: Mon, 7 Nov 1994 03:29:24 GMT
Lines: 17


In the area of image understanding or linguistic parsing,
I have the intuition that combining top-down and bottom-up search
strategies together reduces the search space size enormously
over either strategy separately.  However,  these ideas
are very ill-formed and unstructured.  Does anyone know of any
references to studies of this kind of question that 1) elucidate the issue,
2) are citable?

Thanks in advance,

     Sandy
-- 
	Sandy Dance		                email: sandy@cs.mu.OZ.AU
	Computer Science                   http://www.cs.mu.OZ.AU/~sandy
	University of Melbourne      PGP: finger sandy@munta.cs.mu.OZ.AU
	Parkville, Vic, 3052                        phone: +613 344 9149
