Structural Descriptions And Inexact Matching

Simple item page
dc.contributor.authorShapiro, Linda G.en
dc.contributor.authorHaralick, Robert M.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:37:18Zen
dc.date.available2013-06-19T14:37:18Zen
dc.date.issued1979en
dc.description.abstractIn this paper we formally define the structural description of an object and the concepts of exact and inexact matching of two structural descriptions. We discuss the problems associated with a brute-force backtracking tree search for inexact matching and develop several different algorithms to make the tree search more efficient. We develop the formula for the expected number of nodes in the tree for backtracking alone and vith a forward checking algorithm. Finally we present experimental results verifying the theory and showing that forward checking is the most efficient of the algorithms tested.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000843/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000843/01/CS79011-R.pdfen
dc.identifier.trnumberCS79011-Ren
dc.identifier.urihttp://hdl.handle.net/10919/20325en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleStructural Descriptions And Inexact Matchingen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
CS79011-R.pdf
Size:
2.53 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports