778 search results - page 5 / 156 » Improved universal denominators |
TCS
2011
13 years 2 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
ICISC
2007
13 years 8 months ago
2007
Naor and Reingold had proposed the construction of a strong pseudo-random permutation (SPRP) by using a layer of ECB encryption between two layers of invertible block-wise universa...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing ma...
INTERSPEECH
2010
13 years 2 months ago
2010
This paper describes Brno University of Technology (BUT) system for the Interspeech 2010 Paralinguistic Challenge. Our submitted systems for the Age- and Gender-Sub-Challenges emp...
ISW
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. Canetti and Rabin recently proposed a universally composable ideal functionality FSIG for digital signatures. We show that this functionality cannot be securely realized ...