Sciweavers

185 search results - page 36 / 37
» Non-homogeneous generalization in privacy preserving data pu...
Sort
View
SIGMOD
2008
ACM
89views Database» more  SIGMOD 2008»
14 years 7 months ago
Towards identity anonymization on graphs
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities ...
Kun Liu, Evimaria Terzi
STORAGESS
2006
ACM
14 years 1 months ago
Long-term threats to secure archives
Archival storage systems are designed for a write-once, read-maybe usage model which places an emphasis on the long-term preservation of their data contents. In contrast to tradit...
Mark W. Storer, Kevin M. Greenan, Ethan L. Miller
TIT
2010
138views Education» more  TIT 2010»
13 years 2 months ago
Functional compression through graph coloring
Motivated by applications to sensor networks and privacy preserving databases, we consider the problem of functional compression. The objective is to separately compress possibly c...
Vishal Doshi, Devavrat Shah, Muriel Médard,...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 7 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
14 years 7 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...