Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem (bibtex)
by ,
Reference:
Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree ProblemGünther R. Raidl, Andreas ChwatalNumerical Analysis and Applied Mathematics (T. E. Simos, ed.), volume 936 of AIP Conference Proceedings, pages 444–447, 2007, American Institute of Physics.
Bibtex Entry:
@INPROCEEDINGS{raidl-07a,
author = {G\"unther R. Raidl and Andreas Chwatal},
title = {Fingerprint Template Compression by Solving a Minimum Label k-Node Subtree Problem},
booktitle = {Numerical Analysis and Applied Mathematics},
series = {AIP Conference Proceedings},
volume = 936,
editor = {T. E. Simos},
publisher = {American Institute of Physics},
year = 2007,
pages = {444--447},
keywords = {evolcomp,netdesign,mip},
url = {https://www.ac.tuwien.ac.at/files/pub/raidl-07a.pdf},
}
Powered by bibtexbrowser