14699 search results - page 160 / 2940 » Complexity and Cognitive Computing |
117
click to vote
CIE
2010
Springer
15 years 5 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
115
click to vote
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
96
Voted
CMMR
2007
Springer
15 years 6 months ago
2007
Springer
This paper discusses musical form from a cognitive and a computational viewpoint. While several time-windows exist in the brain, we here put emphasis on the superchunks of up to mo...
ICNC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Humans have the ability to flexibly adjust their information processing strategy according to situational characteristics. However, such ability has been largely overloo...
88
Voted
ACL
2010
14 years 10 months ago
2010
Probabilistic models of sentence comprehension are increasingly relevant to questions concerning human language processing. However, such models are often limited to syntactic fac...