Sciweavers

2479 search results - page 351 / 496
» A Computational Theory of Working Memory
Sort
View
ICMI
2003
Springer
96views Biometrics» more  ICMI 2003»
15 years 11 months ago
Learning and reasoning about interruption
We present methods for inferring the cost of interrupting users based on multiple streams of events including information generated by interactions with computing devices, visual ...
Eric Horvitz, Johnson Apacible
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 11 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
ASIACRYPT
2000
Springer
15 years 11 months ago
Unconditionally Secure Digital Signature Schemes Admitting Transferability
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hi...
KBSE
1999
IEEE
15 years 10 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
CCS
2006
ACM
15 years 10 months ago
Can machine learning be secure?
Machine learning systems offer unparalled flexibility in dealing with evolving input in a variety of applications, such as intrusion detection systems and spam e-mail filtering. H...
Marco Barreno, Blaine Nelson, Russell Sears, Antho...