Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (Q846172)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates |
scientific article; zbMATH DE number 5665094
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates |
scientific article; zbMATH DE number 5665094 |
Statements
Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates (English)
0 references
1 February 2010
0 references
combinatorial optimization
0 references
metaheuristics
0 references
GRASP
0 references
memetic algorithm
0 references
biometric template compression
0 references
fingerprint minutiae
0 references
unordered data set compression
0 references
