Sciweavers

7200 search results - page 407 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
ASIACRYPT
2001
Springer
15 years 11 months ago
On the Insecurity of a Server-Aided RSA Protocol
Abstract. At Crypto ’88, Matsumoto, Kato and Imai proposed a protocol, known as RSA-S1, in which a smart card computes an RSA signature, with the help of an untrusted powerful se...
Phong Q. Nguyen, Igor Shparlinski
SIGCSE
1997
ACM
111views Education» more  SIGCSE 1997»
15 years 11 months ago
Function objects, function templates, and passage by behavior in C++
Passing functions and function objects to general routines is a powerful abstraction mechanism that should be taught in freshman computer science. In C++, a “function” can be ...
Richard Rasala
EURODAC
1994
IEEE
120views VHDL» more  EURODAC 1994»
15 years 11 months ago
Generating compilers for generated datapaths
Modern CAD systems allow the designers to come up with powerful programmable datapaths in avery short time. The time to develop compilers for this datapaths is much longer. This p...
Michael Held, Manfred Glesner
180
Voted
ICCAD
1994
IEEE
139views Hardware» more  ICCAD 1994»
15 years 11 months ago
Switching activity analysis considering spatiotemporal correlations
This work presents techniques for computing the switching activities of all circuit nodes under pseudorandom or biased input sequences and assuming a zero delay mode of operation....
Radu Marculescu, Diana Marculescu, Massoud Pedram
AISB
2008
Springer
15 years 9 months ago
Social Robotics and the person problem
Like computers before them, social robots can be used as a fundamental research tool. Indeed, they can help us to turn our attention from putative inner modules to thinking about t...
Stephen J. Cowley