14774 search results - page 484 / 2955 » Computational complexity and evolutionary computation |
183
click to vote
ICPR
2008
IEEE
16 years 1 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...
199
click to vote
ICS
2001
Tsinghua U.
15 years 11 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...
165
click to vote
CSR
2007
Springer
15 years 10 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...
177
click to vote
ACL
2010
15 years 4 months ago
2010
We describe the strategy currently pursued for verbalising OWL ontologies by sentences in Controlled Natural Language (i.e., combining generic rules for realising logical patterns...
192
click to vote
DLT
2009
15 years 4 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...