Sciweavers

4908 search results - page 610 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
SIGMOD
2011
ACM
170views Database» more  SIGMOD 2011»
14 years 9 months ago
Warding off the dangers of data corruption with amulet
Occasional corruption of stored data is an unfortunate byproduct of the complexity of modern systems. Hardware errors, software bugs, and mistakes by human administrators can corr...
Nedyalko Borisov, Shivnath Babu, NagaPramod Mandag...
ATAL
2011
Springer
14 years 6 months ago
Towards a unifying characterization for quantifying weak coupling in dec-POMDPs
Researchers in the field of multiagent sequential decision making have commonly used the terms “weakly-coupled” and “loosely-coupled” to qualitatively classify problems i...
Stefan J. Witwicki, Edmund H. Durfee
CASES
2011
ACM
14 years 6 months ago
Cost-effective safety and fault localization using distributed temporal redundancy
Cost pressure is driving vendors of safety-critical systems to integrate previously distributed systems. One natural approach we have previous introduced is On-Demand Redundancy (...
Brett H. Meyer, Benton H. Calhoun, John Lach, Kevi...
CCS
2011
ACM
14 years 6 months ago
Policy auditing over incomplete logs: theory, implementation and applications
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
Deepak Garg, Limin Jia, Anupam Datta
GAMESEC
2011
287views Game Theory» more  GAMESEC 2011»
14 years 6 months ago
Collaborative Location Privacy with Rational Users
Recent smartphones incorporate embedded GPS devices that enable users to obtain geographic information about their surroundings by providing a location-based service (LBS) with the...
Francisco Santos, Mathias Humbert, Reza Shokri, Je...