Sciweavers

126 search results - page 19 / 26
» Information Theory and the Security of Binary Data Perturbat...
Sort
View
INFOCOM
2000
IEEE
13 years 12 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
ICBA
2004
Springer
143views Biometrics» more  ICBA 2004»
14 years 26 days ago
Externalized Fingerprint Matching
The 9/11 tragedy triggered an increased interest in biometric passports. According to several sources [2], the electronic ID market is expected to increase by more than 50% per ann...
Claude Barral, Jean-Sébastien Coron, David ...
WCET
2010
13 years 5 months ago
Bounding the Effects of Resource Access Protocols on Cache Behavior
The assumption of task independence has long been consubstantial with the formulation of many schedulability analysis techniques. That assumption is evidently advantageous for the...
Enrico Mezzetti, Marco Panunzio, Tullio Vardanega
CCS
2006
ACM
13 years 11 months ago
Finding the original point set hidden among chaff
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
Ee-Chien Chang, Ren Shen, Francis Weijian Teo
CCS
2008
ACM
13 years 9 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...