5964 search results - page 346 / 1193 » A theory of speculative computation |
189
Voted
ASIACRYPT
1991
Springer
15 years 11 months ago
1991
Springer
In [1] a construction of a block cipher from a single pseudorandom permutation is proposed. In a complexity theoretical setting they prove that this scheme is secure against a pol...
172
Voted
C3S2E
2008
ACM
15 years 9 months ago
2008
ACM
In this paper we define four operations on musical rhythms that preserve a property called maximal evenness. The operations we describe are shadow, complementation, concatenation,...
195
click to vote
WSCG
2001
15 years 8 months ago
2001
In computer graphics and engineering many classes of complex objects can be designed with L-systems. We present a concept for enhancing timed and parametric L-systems with physics...
164
click to vote
EACL
1989
ACL Anthology
15 years 8 months ago
1989
ACL Anthology
In this paper, we present a logic-based computational model for movement theory in Government and Binding Theory. For that purpose, we have designed a language called DISLOG. DISL...
195
Voted
BIRTHDAY
2010
Springer
15 years 8 months ago
2010
Springer
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...