Sciweavers

3092 search results - page 522 / 619
» Where are you pointing
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 10 days ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
FAST
2010
13 years 11 months ago
Understanding Latent Sector Errors and How to Protect Against Them
Latent sector errors (LSEs) refer to the situation where particular sectors on a drive become inaccessible. LSEs are a critical factor in data reliability, since a single LSE can ...
Bianca Schroeder, Sotirios Damouras, Phillipa Gill
AAAI
2008
13 years 11 months ago
Perpetual Learning for Non-Cooperative Multiple Agents
This paper examines, by argument, the dynamics of sequences of behavioural choices made, when non-cooperative restricted-memory agents learn in partially observable stochastic gam...
Luke Dickens
USS
2008
13 years 11 months ago
The Practical Subtleties of Biometric Key Generation
The inability of humans to generate and remember strong secrets makes it difficult for people to manage cryptographic keys. To address this problem, numerous proposals have been s...
Lucas Ballard, Seny Kamara, Michael K. Reiter
ATAL
2008
Springer
13 years 11 months ago
A tractable and expressive class of marginal contribution nets and its applications
Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficien...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...