4616 search results - page 342 / 924 » The Communication Complexity of Correlation |
188
click to vote
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
We use the theory and algorithms developed for so-called shiftinvariant spaces to develop a novel distributed architecture for sampling and reconstructing non-bandlimited fields i...
192
click to vote
JCIT
2010
15 years 1 months ago
2010
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...
199
click to vote
SCP
2010
15 years 1 months ago
2010
Analyzing the evolution of large and long-lived software systems is a complex problem that requires extensive tool support due to the amount and complexity of the data that needs ...
193
click to vote
ACISP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many algorithmic problems, which are used to prove the security of a cryptographic system, are shown to be characterized as the subgroup membership problem. We then apply...
246
click to vote
BMCBI
2011
15 years 1 months ago
2011
Background: Atomic Solvation Parameters (ASP) model has been proven to be a very successful method of calculating the binding free energy of protein complexes. This suggests that ...