3235 search results - page 113 / 647 » Partial Redundant Modeling |
142
Voted
TCC
2009
Springer
16 years 4 months ago
2009
Springer
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
153
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: Understanding how proteins fold is essential to our quest in discovering how life works at the molecular level. Current computation power enables researchers to produc...
118
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
136
click to vote
HCI
2009
15 years 1 months ago
2009
Sign language (SL) recognition modules in human-computer interaction systems need to be both fast and reliable. In cases where multiple sets of features are extracted from the SL d...
171
click to vote
SIAMREV
2010
14 years 11 months ago
2010
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...