4908 search results - page 794 / 982 » On the Complexity of Optimal K-Anonymity |
156
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
Consider a set of players that are interested in collectively evaluating a set of objects. We develop a collaborative scoring protocol in which each player evaluates a subset of t...
183
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
188
click to vote
CSMR
2009
IEEE
15 years 11 months ago
2009
IEEE
Creating accurate models of information systems is an important but challenging task. It is generally well understood that such modeling encompasses general scientific issues, bu...
154
click to vote
ASPDAC
2009
ACM
15 years 11 months ago
2009
ACM
– The phenomenon of digital convergence and increasing application complexity today is motivating the design of chip multiprocessor (CMP) applications with multiple use cases. Mo...
154
click to vote
EUROPAR
2009
Springer
15 years 11 months ago
2009
Springer
A high-level understanding of how an application executes and which performance characteristics it exhibits is essential in many areas of high performance computing, such as applic...