Sciweavers

7486 search results - page 195 / 1498
» The Limits of Quantum Computers
Sort
View
IJON
2007
55views more  IJON 2007»
15 years 5 months ago
Short-term plasticity in a computational model of the tail-withdrawal circuit in Aplysia
The tail-withdrawal circuit of Aplysia provides a useful model system for investigating synaptic dynamics. Sensory neurons within the circuit manifest several forms of synaptic pl...
Douglas A. Baxter, John H. Byrne
HICSS
2003
IEEE
121views Biometrics» more  HICSS 2003»
15 years 11 months ago
MOBICHARTS: A Notation to Specify Mobile Computing Applications
A standard notation, that unambiguously expresses different aspects of a system, is important to the process of software development. The expressiveness of a standard notation hel...
Satyajit Acharya, Hrushikesha Mohanty, R. K. Shyam...
CCA
2009
Springer
16 years 24 days ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
BMCBI
2010
185views more  BMCBI 2010»
15 years 6 months ago
ABCtoolbox: a versatile toolkit for approximate Bayesian computations
Background: The estimation of demographic parameters from genetic data often requires the computation of likelihoods. However, the likelihood function is computationally intractab...
Daniel Wegmann, Christoph Leuenberger, Samuel Neue...
AOR
2010
15 years 3 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...