Sciweavers

796 search results - page 94 / 160
» The Anonymous Subgraph Problem
Sort
View
EDBT
2004
ACM
234views Database» more  EDBT 2004»
16 years 2 months ago
A Condensation Approach to Privacy Preserving Data Mining
In recent years, privacy preserving data mining has become an important problem because of the large amount of personal data which is tracked by many business applications. In many...
Charu C. Aggarwal, Philip S. Yu
128
Voted
ISW
2009
Springer
15 years 9 months ago
Privacy-Aware Attribute-Based Encryption with User Accountability
As a new public key primitive, attribute-based encryption (ABE) is envisioned to be a promising tool for implementing fine-grained access control. To further address the concern o...
Jin Li, Kui Ren, Bo Zhu, Zhiguo Wan
121
Voted
QEST
2010
IEEE
15 years 13 days ago
Information Hiding in Probabilistic Concurrent Systems
Information hiding is a general concept which refers to the goal of preventing an adversary to infer secret information from the observables. Anonymity and Information Flow are exa...
Miguel E. Andrés, Catuscia Palamidessi, Pet...
150
Voted
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
15 years 9 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...
126
Voted
ANOR
2005
160views more  ANOR 2005»
15 years 2 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...