Sciweavers

406 search results - page 14 / 82
» Privacy-Preserving Set Union
Sort
View
VLDB
2005
ACM
136views Database» more  VLDB 2005»
14 years 29 days ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
ACSW
2007
13 years 9 months ago
Controlling Inference: Avoiding P-level Reduction during Analysis
This paper presents a concept hierarchy-based approach to privacy preserving data collection for data mining called the P-level model. The P-level model allows data providers to d...
Adepele Williams, Ken Barker
GLOBECOM
2006
IEEE
14 years 1 months ago
Requirements and Challenges in the Design of Privacy-aware Sensor Networks
Abstract— Sensor networks are set to become a truly ubiquitous technology that will affect the lives of the people in their application environment. While providing the opportuni...
Efthimia Aivaloglou, Stefanos Gritzalis, Charalabo...
MP
2008
99views more  MP 2008»
13 years 7 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
GC
2002
Springer
13 years 7 months ago
Ramsey-Type Results for Unions of Comparability Graphs
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
Adrian Dumitrescu, Géza Tóth