"9788090425743" . . "5"^^ . "[CA90B49BC9E1]" . . . . "Santacrypt 2012: Proceedings" . "B\u00EDlovice nad Svitavou" . "P(LA 168)" . "RIV/00216224:14330/12:00062123" . . . "Accelerating Biometric Identification"@en . . "2012-11-29+01:00"^^ . "14330" . . "1"^^ . "Trusted Network Solutions, a.s." . . . . "120833" . "\u0158\u00EDha, Zden\u011Bk" . . "By opposition to biometric matching, biometric identification is a relatively costly process. Let B = (b1, ..., bn) be a database of n biometric templates and let b be a given individual biometric acquisition. The biometric identification problem consists in finding the most likely bi corresponding to b. This paper assumes the existence of an oracle A taking as b and bi, and responding with true or false. Considering A as an atomic operation, any system-level optimization must necessarily minimize the number of calls to A per identification session. This is the parameter that we optimize in this paper."@en . "Naccache, David" . "2"^^ . . "Accelerating Biometric Identification" . "Accelerating Biometric Identification" . "biometrics; statistics; authentication"@en . . . "By opposition to biometric matching, biometric identification is a relatively costly process. Let B = (b1, ..., bn) be a database of n biometric templates and let b be a given individual biometric acquisition. The biometric identification problem consists in finding the most likely bi corresponding to b. This paper assumes the existence of an oracle A taking as b and bi, and responding with true or false. Considering A as an atomic operation, any system-level optimization must necessarily minimize the number of calls to A per identification session. This is the parameter that we optimize in this paper." . "Praha" . . "RIV/00216224:14330/12:00062123!RIV13-MSM-14330___" . . "Accelerating Biometric Identification"@en .