Sciweavers

406 search results - page 23 / 82
» Privacy-Preserving Set Union
Sort
View
CCCG
2007
13 years 9 months ago
A Lower Bound on the Area of a 3-Coloured Disc Packing
Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured
Peter Brass, Ferran Hurtado, Benjamin J. Lafrenier...
TDSC
2011
13 years 2 months ago
CASTLE: Continuously Anonymizing Data Streams
— Most of existing privacy preserving techniques, such as k-anonymity methods, are designed for static data sets. As such, they cannot be applied to streaming data which are cont...
Jianneng Cao, Barbara Carminati, Elena Ferrari, Ki...
PVLDB
2011
13 years 2 months ago
Personalized Social Recommendations - Accurate or Private?
With the recent surge of social networks such as Facebook, new forms of recommendations have become possible – recommendations that rely on one’s social connections in order t...
Ashwin Machanavajjhala, Aleksandra Korolova, Atish...
DEDS
2002
85views more  DEDS 2002»
13 years 7 months ago
A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems
Abstract. We consider a generalized form of the conventional decentralized control architecture for discreteevent systems where the control actions of a set of supervisors can be `...
Tae-Sic Yoo, Stéphane Lafortune
FOSSACS
2007
Springer
14 years 1 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard