4908 search results - page 299 / 982 » On the Complexity of Optimal K-Anonymity |
183
click to vote
JSA
2000
15 years 6 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
145
click to vote
CGF
1998
15 years 6 months ago
1998
Progressive addition lenses are a relatively new approach to compensate for defects of the human visual system. While traditional spectacles use rotationally symmetric lenses, pro...
174
click to vote
OOPSLA
2010
Springer
15 years 5 months ago
2010
Springer
Accurately predicting program behaviors (e.g., locality, dependency, method calling frequency) is fundamental for program optimizations and runtime adaptations. Despite decades of...
170
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
179
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...