Sciweavers

1689 search results - page 326 / 338
» Approximate zero-variance simulation
Sort
View
AML
2008
124views more  AML 2008»
14 years 9 months ago
The elementary computable functions over the real numbers: applying two new techniques
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
Manuel Lameiras Campagnolo, Kerry Ojakian
CSL
2010
Springer
14 years 9 months ago
Bayesian update of dialogue state: A POMDP framework for spoken dialogue systems
This paper describes a statistically motivated framework for performing real-time dialogue state updates and policy learning in a spoken dialogue system. The framework is based on...
Blaise Thomson, Steve Young
BMCBI
2006
131views more  BMCBI 2006»
14 years 9 months ago
Hybridization interactions between probesets in short oligo microarrays lead to spurious correlations
Background: Microarrays measure the binding of nucleotide sequences to a set of sequence specific probes. This information is combined with annotation specifying the relationship ...
Michal J. Okoniewski, Crispin J. Miller
BMCBI
2006
117views more  BMCBI 2006»
14 years 9 months ago
A method for estimation of elasticities in metabolic networks using steady state and dynamic metabolomics data and linlog kineti
Background: Dynamic modeling of metabolic reaction networks under in vivo conditions is a crucial step in order to obtain a better understanding of the (dis)functioning of living ...
I. Emrah Nikerel, Wouter A. van Winden, Walter M. ...
EJC
2007
14 years 9 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...