50 search results - page 4 / 10 » Language Compression and Pseudorandom Generators |
MM
1997
ACM
13 years 11 months ago
1997
ACM
We present the design and implementation of a new programming language for media-intensive applications called Flavor (Formal Language for Audio-Visual Object Representation). It ...
MFCS
2005
Springer
14 years 29 days ago
2005
Springer
We show the following results regarding complete sets. • NP-complete sets and PSPACE-complete sets are many-one autoreducible. • Complete sets of any level of PH, MODPH, or th...
IFIP
2001
Springer
13 years 12 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
NLE
2007
13 years 7 months ago
2007
We address the problem of improving the efficiency of natural language text input under degraded conditions (for instance, on mobile computing devices or by disabled users), by ta...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...