28 search results - page 2 / 6 » re 2011 |
86
Voted
TIT
2011
14 years 4 months ago
2011
Abstract. In 1998, Blaze, Bleumer, and Strauss proposed a cryptographic primitive called proxy re-encryption, in which a proxy transforms – without seeing the corresponding plain...
131
Voted
DCC
2011
IEEE
14 years 4 months ago
2011
IEEE
Larsson and Moffat’s RePair algorithm is generalized from strings to trees. The new algorithm (TreeRePair) produces straight-line linear context-free tree (SLT) grammars which a...
ICSE
2011
IEEE-ACM
14 years 27 days ago
2011
IEEE-ACM
Successful software systems continuously change their requirements and thus code. When this happens, some existing tests get broken because they no longer reflect the intended be...
EUROSYS
2011
ACM
14 years 28 days ago
2011
ACM
We introduce Re-FUSE, a framework that provides support for restartable user-level file systems. Re-FUSE monitors the user-level file-system and on a crash transparently restart...
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
Typically, users interact with database systems by formulating queries. However, many times users do not have a clear understanding of their information needs or the exact content...