588 search results - page 51 / 118 » Reducibility and Completeness in Private Computations |
IPPS
1996
IEEE
14 years 2 months ago
1996
IEEE
In a shared-memory multiprocessor system, it is possible that certain synchronization operations are redundant -that is, their corresponding sequencing requirements are enforced c...
SAC
2008
ACM
13 years 9 months ago
2008
ACM
Leakage power in cache memories represents a sizable fraction of total power consumption, and many techniques have been proposed to reduce it. As a matter of fact, during a fixed ...
ACL
2011
13 years 1 months ago
2011
We present an unsupervised model for joint phrase alignment and extraction using nonparametric Bayesian methods and inversion transduction grammars (ITGs). The key contribution is...
ICIP
2004
IEEE
14 years 11 months ago
2004
IEEE
In this paper we propose a fast motion estimation technique that works in the wavelet domain. The computational cost of the algorithm turns out to be proportional to the linear si...
MFCS
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...