796 search results - page 52 / 160 » The Anonymous Subgraph Problem |
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
128
Voted
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
Radio Frequency IDentification (RFID) technology has attracted much attention due to its variety of applications, e.g., inventory control and object tracking. One important problem...
164
Voted
VLDB
2007
ACM
16 years 27 days ago
2007
ACM
Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and -diversity. k-a...
156
click to vote
ISAAC
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. In this paper, we consider the problem of predicate encryption and focus on the predicate for testing whether the hamming distance between the attribute X of a data item ...
192
Voted
VLDB
2008
ACM
16 years 27 days ago
2008
ACM
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...