Sciweavers

14 search results - page 3 / 3
» Computer aided creativity: practical experience and theoreti...
Sort
View
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 6 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
DAC
2009
ACM
14 years 7 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
PAMI
2006
186views more  PAMI 2006»
13 years 6 months ago
Performance Evaluation of Fingerprint Verification Systems
This paper is concerned with the performance evaluation of fingerprint verification systems. After an initial classification of biometric testing initiatives, we explore both the t...
Raffaele Cappelli, Dario Maio, Davide Maltoni, Jam...
PAMI
2007
133views more  PAMI 2007»
13 years 5 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...