Sciweavers

24680 search results - page 4679 / 4936
» Learning
Sort
View
ICCD
2005
IEEE
165views Hardware» more  ICCD 2005»
14 years 7 months ago
Counter-Based Cache Replacement Algorithms
Recent studies have shown that in highly associative caches, the performance gap between the Least Recently Used (LRU) and the theoretical optimal replacement algorithms is large,...
Mazen Kharbutli, Yan Solihin
SOSP
2007
ACM
14 years 7 months ago
/*icomment: bugs or bad comments?*/
Commenting source code has long been a common practice in software development. Compared to source code, comments are more direct, descriptive and easy-to-understand. Comments and...
Lin Tan, Ding Yuan, Gopal Krishna, Yuanyuan Zhou
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
14 years 7 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
TCC
2010
Springer
324views Cryptology» more  TCC 2010»
14 years 7 months ago
Leakage-Resilient Signatures
The strongest standard security notion for digital signature schemes is unforgeability under chosen message attacks. In practice, however, this notion can be insufficient due to ...
Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, G...
PEPM
2009
ACM
14 years 7 months ago
Self-adjusting computation: (an overview)
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
Umut A. Acar
« Prev « First page 4679 / 4936 Last » Next »