1712 search results - page 299 / 343 » A Computational Approach to Binding Theory |
167
Voted
BMCBI
2011
14 years 8 months ago
2011
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
236
click to vote
ICFP
2009
ACM
16 years 2 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
112
click to vote
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
As a learning method support vector machine is regarded as one of the best classifiers with a strong mathematical foundation. On the other hand, evolutionary computational techniq...
CIE
2010
Springer
15 years 5 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
123
click to vote
COGCOM
2010
14 years 11 months ago
2010
To decide ``Where to look next ?'' is a central function of the attention system of humans, animals and robots. Control of attention depends on three factors, that is, lo...