Skip navigation
Skip navigation

Approximating the Problem, not the Solution: An Alternative View of Point Set Matching

Caetano, Tiberio; Caelli, Terry


This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representational approximation, which involves a simplified and suboptimal modeling for the original problem, and algorithmic approximation, which consists in using suboptimal algorithms to infer the assignment. Matching techniques in general have relied on the second approach: to keep a complete model of the original problem...[Show more]

CollectionsANU Research Publications
Date published: 2005
Type: Journal article
Source: Lecture Notes in Computer Science (LNCS)


There are no files associated with this item.

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator