930 search results - page 78 / 186 » A Universal Encryption Standard |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We prove that every computably enumerable (c.e.) random real is provable in Peano Arithmetic (PA) to be c.e. random. A major step in the proof is to show that the theorem stating ...
ACE
2003
13 years 11 months ago
2003
This paper describes the development, implementation and evaluation of a new teaching approach for a large first year undergraduate course in information systems at the University...
INTERSPEECH
2010
13 years 4 months ago
2010
Automatic language identification (LID) systems generally exploit acoustic knowledge, possibly enriched by explicit language specific phonotactic or lexical constraints. This pape...
STOC
1994
ACM
14 years 2 months ago
1994
ACM
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
CHES
2004
Springer
14 years 3 months ago
2004
Springer
Dual-rail encoding, return-to-spacer protocol and hazard-free logic can be used to resist differential power analysis attacks by making the power consumption independent of process...