Sciweavers

3406 search results - page 8 / 682
» Computational models of classical conditioning
Sort
View
LICS
2003
IEEE
14 years 1 months ago
About Translations of Classical Logic into Polarized Linear Logic
We show that the decomposition of Intuitionistic Logic into Linear Logic along the equation ´ may be adapted into a decomposition of classical logic into LLP, the polarized versi...
Olivier Laurent, Laurent Regnier
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
14 years 1 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
RSKT
2010
Springer
13 years 7 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou
ICPR
2008
IEEE
14 years 3 months ago
Spatio-temporal patches for night background modeling by subspace learning
In this paper, a novel background model on spatio-temporal patches is introduced for video surveillance, especially for night outdoor scene, where extreme lighting conditions ofte...
Youdong Zhao, Haifeng Gong, Liang Lin, Yunde Jia
ANSS
2006
IEEE
14 years 2 months ago
A New Approach for Computing Conditional Probabilities of General Stochastic Processes
In this paper Hidden Markov Model algorithms are considered as a method for computing conditional properties of continuous-time stochastic simulation models. The goal is to develo...
Fabian Wickborn, Claudia Isensee, Thomas Simon, Sa...