4908 search results - page 302 / 982 » On the Complexity of Optimal K-Anonymity |
182
click to vote
IPPS
2005
IEEE
16 years 9 days ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
182
click to vote
PDCAT
2005
Springer
16 years 6 days ago
2005
Springer
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
167
click to vote
AMAI
2004
Springer
16 years 3 days ago
2004
Springer
The majority of the work in the area of Markov decision processes has focused on expected values of rewards in the objective function and expected costs in the constraints. Althou...
161
Voted
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
176
click to vote
PEPM
2009
ACM
15 years 11 months ago
2009
ACM
A requirement of any source language is to be rich in features and concise to use by the programmers. As a drawback, it is often too complex to analyse, causing research studies t...