796 search results - page 79 / 160 » The Anonymous Subgraph Problem |
76
Voted
KDD
2007
ACM
16 years 1 months ago
2007
ACM
Abstract. In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships fr...
113
Voted
ADC
2010
Springer
14 years 7 months ago
2010
Springer
Nowadays privacy becomes a major concern and many research efforts have been dedicated to the development of privacy protecting technology. Anonymization techniques provide an eff...
83
Voted
DEXAW
2007
IEEE
15 years 7 months ago
2007
IEEE
We present a security engineering process based on security problem frames and concretized security problem frames. Both kinds of frames constitute patterns for analyzing security...
95
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
74
Voted
AAIM
2007
Springer
15 years 7 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...