Sciweavers

92 search results - page 13 / 19
» Generating Shorter Bases for Hard Random Lattices
Sort
View
PAMI
2007
133views more  PAMI 2007»
14 years 11 months ago
Generating Cancelable Fingerprint Templates
—Biometrics-based authentication systems offer obvious usability advantages over traditional password and token-based authentication schemes. However, biometrics raises several p...
Nalini K. Ratha, Sharat Chikkerur, Jonathan H. Con...
TSMC
2010
14 years 6 months ago
Cancelable Templates for Sequence-Based Biometrics with Application to On-line Signature Recognition
Recent years have seen the rapid spread of biometric technologies for automatic people recognition. However, security and privacy issues still represent the main obstacles for the ...
Emanuele Maiorana, Patrizio Campisi, Julian Fi&eac...
CSE
2009
IEEE
15 years 6 months ago
Bio-chaotic Stream Cipher-Based Iris Image Encryption
Conventional cryptography uses encryption key, which are long bit strings and are very hard to memorize such a long random numbers. Also it can be easily attacked by using the brut...
Abdullah Sharaf Alghamdi, Hanif Ullah, Maqsood Mah...
KI
2001
Springer
15 years 4 months ago
Constraint-Based Optimization of Priority Schemes for Decoupled Path Planning Techniques
Abstract Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled...
Maren Bennewitz, Wolfram Burgard, Sebastian Thrun
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 3 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill