588 search results - page 9 / 118 » Reducibility and Completeness in Private Computations |
PARA
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. A program analysis tool can play an important role in helping users understand and improve OpenMP codes. Array privatization is one of the most effective ways to improve...
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
Prior work in differential privacy has produced techniques for answering aggregate queries over sensitive data in a privacypreserving way. These techniques achieve privacy by addi...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
ACHI
2008
IEEE
14 years 1 months ago
2008
IEEE
— Almost everyone has experienced fear at least once in their life because of a test. Fear can positively mobilise students, when it is under control. However, when fear becomes ...
ICS
2005
Tsinghua U.
14 years 29 days ago
2005
Tsinghua U.
We propose an organization for the on-chip memory system of a chip multiprocessor, in which 16 processors share a 16MB pool of 256 L2 cache banks. The L2 cache is organized as a n...