14699 search results - page 286 / 2940 » Complexity and Cognitive Computing |
132
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper proposes a novel Texture Pattern Flow (TPF) for complex background modeling and motion detection. The Pattern Flow is proposed to encode the binary pattern changes amon...
154
click to vote
ICS
2001
Tsinghua U.
15 years 8 months ago
2001
Tsinghua U.
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...
121
click to vote
FPCA
1989
15 years 8 months ago
1989
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
123
Voted
CSR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
157
click to vote
CIE
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...