Sciweavers

3378 search results - page 24 / 676
» A universe of binding and computation
Sort
View
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
15 years 10 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
CIE
2006
Springer
15 years 1 months ago
Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal
le conservative rational abstract geometrical computation is Turing-universal d abstract) J
Jérôme Durand-Lose
RECOMB
2006
Springer
15 years 10 months ago
Improving Prediction of Zinc Binding Sites by Modeling the Linkage Between Residues Close in Sequence
Abstract. We describe and empirically evaluate machine learning methods for the prediction of zinc binding sites from protein sequences. We start by observing that a data set consi...
Sauro Menchetti, Andrea Passerini, Paolo Frasconi,...
GCB
2005
Springer
96views Biometrics» more  GCB 2005»
15 years 3 months ago
Thermodynamics of RNA-RNA Binding
We present an extension of the standard partition function approach to RNA secondary structures that computes the probabilities Pu[i, j] that a sequence interval [i, j] is unpaired...
Ulrike Mückstein, Hakim Tafer, Jörg Hack...
IPPS
1997
IEEE
15 years 1 months ago
A Fast Scalable Universal Matrix Multiplication Algorithm on Distributed-Memory Concurrent Computers
We present a fast and scalable matrix multiplication algorithm on distributed memory concurrent computers, whose performance is independent of data distribution on processors, and...
J. Choi