Accession Number:

ADA071601

Title:

Discrete Relaxation for Matching Relational Structures

Descriptive Note:

Technical rept.

Corporate Author:

MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER

Personal Author(s):

Report Date:

1978-06-01

Pagination or Media Count:

38.0

Abstract:

Local constraint analysis discrete relaxation is used to reduce ambiguity in matching pairs of relational structures. It is found empirically that if the set of possible local properties is sufficiently large, this generally results in unambiguous identifications after only a few iterations.

Subject Categories:

  • Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE