Sciweavers

1399 search results - page 134 / 280
» Multi-party Finite Computations
Sort
View
DAGSTUHL
2007
15 years 5 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
ALT
1998
Springer
15 years 8 months ago
Synthesizing Learners Tolerating Computable Noisy Data
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) ...
John Case, Sanjay Jain
AOR
2010
15 years 1 months ago
Computing general static-arbitrage bounds for European basket options via Dantzig-Wolfe decomposition
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
Javier Peña, Xavier Saynac, Juan Carlos Ver...
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
16 years 4 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
SC
2005
ACM
15 years 9 months ago
Bridging the Macro and Micro: A Computing Intensive Earthquake Study Using Discovery Net
We present the development and use of a novel distributed geohazard modeling environment for the analysis and interpretation of large scale earthquake data sets. Our work demonstr...
Yike Guo, Jian Guo Liu, Moustafa Ghanem, Kyran Mis...