Sciweavers

5964 search results - page 875 / 1193
» A theory of speculative computation
Sort
View
PLDI
2009
ACM
16 years 1 months ago
A weakest precondition approach to active attacks analysis
Information flow controls can be used to protect both data confidentiality and data integrity. The certification of the security degree of a program that runs in untrusted envi...
Musard Balliu, Isabella Mastroeni
SENSYS
2009
ACM
16 years 1 months ago
Optimal clock synchronization in networks
Having access to an accurate time is a vital building block in all networks; in wireless sensor networks even more so, because wireless media access or data fusion may depend on i...
Christoph Lenzen, Philipp Sommer, Roger Wattenhofe...
172
Voted
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
16 years 1 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
ATAL
2009
Springer
16 years 1 months ago
The price of democracy in coalition formation
Whenever rational agents form coalitions to execute tasks, doing so via a decentralized negotiation process—while more robust and democratic—may lead to a loss of efficiency ...
Georgios Chalkiadakis, Edith Elkind, Maria Polukar...
SACMAT
2009
ACM
16 years 1 months ago
Foundations for group-centric secure information sharing models
We develop the foundations for a theory of Group-Centric Secure Information Sharing (g-SIS), characterize a specific family of models in this arena and identify several direction...
Ram Krishnan, Ravi S. Sandhu, Jianwei Niu, William...