796 search results - page 33 / 160 » The Anonymous Subgraph Problem |
CORR
2012
Springer
12 years 5 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
ICPR
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper, we propose a novel multi-class graph boosting algorithm to recognize different visual objects. The proposed method treats subgraph as feature to construct base clas...
IIWAS
2004
13 years 11 months ago
2004
Group signature schemes permit a group member signing on messages anonymously and unlinkably on behalf of a group. The anonymity can be revoked when arguments occurred. This paper...
STOC
2009
ACM
14 years 10 months ago
2009
ACM
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
ICDM
2005
IEEE
14 years 3 months ago
2005
IEEE
In this paper we study when the disclosure of data mining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty o...