5183 search results - page 297 / 1037 » The Complexity of Distributions |
172
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
There are many applications for Secure Multi-Party Computation (SMC), but practical adoption is still an issue. One reason is that the business model of the application does not m...
190
click to vote
APPROX
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
183
click to vote
COORDINATION
2006
Springer
15 years 10 months ago
2006
Springer
How to coordinate the processes in a complex component-based software system is a nontrivial issue. Many different coordination approaches exist, each with its own specific advanta...
153
click to vote
PVM
2010
Springer
15 years 5 months ago
2010
Springer
MPI datatypes are a convenient abstraction for manipulating complex data structures and are useful in a number of contexts. In some cases, these descriptions need to be preserved o...
200
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. As heterogeneous computing platforms become more prevalent, the programmer must account for complex memory hierarchies in addition to the difficulties of parallel program...