14774 search results - page 449 / 2955 » Computational complexity and evolutionary computation |
179
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
182
click to vote
CIE
2009
Springer
16 years 1 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
178
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper proposes a method for constructing a discriminative rotation invariant object recognition system from the set of complex moments by using a multi-class boosting algorit...
124
click to vote
CIE
2005
Springer
16 years 11 days ago
2005
Springer
We investigate the computational complexity of an optical model of computation called the continuous space machine (CSM). We characterise worst case resource growth over time for e...
188
click to vote
IWCM
2004
Springer
16 years 5 days ago
2004
Springer
Abstract Image sequence processing techniques are an essential tool for the experimental investigation of dynamical processes such as exchange, growth, and transport processes. The...