796 search results - page 40 / 160 » The Anonymous Subgraph Problem |
87
Voted
ICDE
2008
IEEE
15 years 7 months ago
2008
IEEE
— Data privacy is one of the key challenges faced by enterprises today. Anonymization techniques address this problem by sanitizing sensitive data such that individual privacy is...
110
Voted
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
117
click to vote
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
100
Voted
CASES
2006
ACM
15 years 6 months ago
2006
ACM
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
94
Voted
AINA
2010
IEEE
15 years 5 months ago
2010
IEEE
: This paper is on failure detectors to solve the consensus problem in asynchronous systems made up of anonymous processes prone to crash and connected by asynchronous reliable cha...