53 search results - page 2 / 11 » How to Strengthen Pseudo-random Generators by Using Compress... |
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
Induction proofs often fail because the stated theorem is noninductive, in which case the user must strengthen the theorem or prove auxiliary properties before performing the induc...
GRAPHICSINTERFACE
2001
13 years 6 months ago
2001
We show how to use fixed bases for efficient spectral compression of 3D meshes. In contrast with compression using variable bases, this permits efficient decoding of the mesh. The...
JAIR
2008
13 years 4 months ago
2008
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
EVOW
2008
Springer
13 years 6 months ago
2008
Springer
Traditional test generation methodologies for peripheral cores are performed by a skilled test engineer, leading to long generation times. In this paper a test generation methodolo...
COCO
2004
Springer
13 years 10 months ago
2004
Springer
The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given...