Sciweavers

2079 search results - page 350 / 416
» Universality of random graphs
Sort
View
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
15 years 5 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger
TIT
2008
81views more  TIT 2008»
15 years 4 months ago
How to Filter an "Individual Sequence With Feedback"
We consider causally estimating (filtering) the components of a noise-corrupted sequence relative to a reference class of filters. The noiseless sequence to be filtered is designe...
Tsachy Weissman
TCS
2002
15 years 3 months ago
Process algebra for performance evaluation
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined...
Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoe...
BMCBI
2011
14 years 11 months ago
Simulated evolution applied to study the genetic code optimality using a model of codon reassignments
Background: As the canonical code is not universal, different theories about its origin and organization have appeared. The optimization or level of adaptation of the canonical ge...
Jose Santos, Ángel Monteagudo
RECOMB
2003
Springer
16 years 4 months ago
Physical network models and multi-source data integration
We develop a new framework for inferring models of transcriptional regulation. The models in this approach, which we call physical models, are constructed on the basis of verifiab...
Chen-Hsiang Yeang, Tommi Jaakkola