588 search results - page 11 / 118 » Reducibility and Completeness in Private Computations |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper an algorithm based on the ensemble empirical mode decomposition (EEMD) is presented. The key idea on the EEMD relies on averaging the modes obtained by EMD applied t...
EUROCRYPT
2010
Springer
14 years 8 days ago
2010
Springer
A seminal result of Cleve (STOC ’86) is that, in general, complete fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining...
NSDI
2010
13 years 9 months ago
2010
MapReduce is a popular framework for data-intensive distributed computing of batch jobs. To simplify fault tolerance, many implementations of MapReduce materialize the entire outp...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
ICPP
1999
IEEE
13 years 11 months ago
1999
IEEE
This paper discusses the implementation using mobile agent and the performance of the market computing to allocate network quality of service most efficiently, based on users'...