Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem

Günther Raidl, Andreas Chwatal
January 2007
PDF bib

Abstract

Full Citation:

Günther R. Raidl, Andreas Chwatal. Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem. Numerical Analysis and Applied Mathematics (T. E. Simos), volume 936 of AIP Conference Proceedings, pages 444-447, 2007, American Institute of Physics.

Type
Conference Paper
Evolcomp Mip Netdesign
Günther Raidl
Günther Raidl

Günther Raidl is a Professor at the Algorithms and Complexity Group.