Sciweavers

1809 search results - page 50 / 362
» Weakly Computable Real Numbers
Sort
View
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 9 months ago
Reliable Multi-Path Routing Schemes for Real-Time Streaming
In off-line streaming, packet level erasure resilient Forward Error Correction (FEC) codes rely on the unrestricted buffering time at the receiver. In real-time streaming, the ext...
Emin Gabrielyan, Roger D. Hersch
NIPS
2008
13 years 11 months ago
Fast Computation of Posterior Mode in Multi-Level Hierarchical Models
Multi-level hierarchical models provide an attractive framework for incorporating correlations induced in a response variable organized in a hierarchy. Model fitting is challengin...
Liang Zhang, Deepak Agarwal
SIAMNUM
2010
87views more  SIAMNUM 2010»
13 years 4 months ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer
SCHOLARPEDIA
2008
92views more  SCHOLARPEDIA 2008»
13 years 9 months ago
Computational models of classical conditioning
: We describe computer simulation of a number of associative models of classical conditioning in an attempt to assess the strengths and weaknesses of each model. The behavior of th...
Nestor A. Schmajuk
CIE
2009
Springer
14 years 4 months ago
Ordinal Computability
computability uses ordinals instead of natural numbers in abstract machines like register or Turing machines. We give an overview of the computational strengths of α-β-machines,...
Peter Koepke