Sciweavers

17409 search results - page 3381 / 3482
» Oblio: Design and Performance
Sort
View
MOBIHOC
2002
ACM
14 years 9 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
14 years 7 months ago
Incentive Compatible Budget Elicitation in Multi-unit Auctions
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
Sayan Bhattacharya, Vincent Conitzer, Kamesh Munag...
ICDCS
2009
IEEE
14 years 7 months ago
File Versioning for Block-Level Continuous Data Protection
Block-level continuous data protection (CDP) logs every disk block update so that disk updates within a time window are undoable. Standard file servers and DBMS servers can enjoy...
Maohua Lu, Tzi-cker Chiueh
EUROSYS
2009
ACM
14 years 7 months ago
Ksplice: automatic rebootless kernel updates
Ksplice allows system administrators to apply patches to their operating system kernels without rebooting. Unlike previous hot update systems, Ksplice operates at the object code ...
Jeff Arnold, M. Frans Kaashoek
EUROSYS
2008
ACM
14 years 7 months ago
Manageable fine-grained information flow
The continuing frequency and seriousness of security incidents underlines the importance of application security. Decentralized information flow control (DIFC), a promising tool ...
Petros Efstathopoulos, Eddie Kohler
« Prev « First page 3381 / 3482 Last » Next »