3406 search results - page 204 / 682 » Computational models of classical conditioning |
167
Voted
SIAMREV
2010
15 years 27 days ago
2010
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
181
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this work a new adaptive fast variational sparse Bayesian learning (V-SBL) algorithm is proposed that is a variational counterpart of the fast marginal likelihood maximization ...
160
click to vote
ICN
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. Even if ...
240
Voted
CVPR
2005
IEEE
15 years 8 months ago
2005
IEEE
Understanding and modifying the effects of arbitrary illumination on human faces in a realistic manner is a challenging problem both for face synthesis and recognition. Recent res...
157
click to vote
ACSD
2008
IEEE
15 years 8 months ago
2008
IEEE
The design of complex concurrent systems often involves intricate performance and dependability considerations. Continuous-time Markov chains (CTMCs) are widely used models for co...