17541 search results - page 428 / 3509 » Complexity in scalable computing |
143
click to vote
STACS
2000
Springer
15 years 9 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
142
Voted
AAAI
2004
15 years 7 months ago
2004
We study the computational complexity of reasoning with global constraints. We show that reasoning with such constraints is intractable in general. We then demonstrate how the sam...
158
click to vote
CIE
2009
Springer
16 years 22 days 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...
159
click to vote
ICPR
2008
IEEE
16 years 17 days 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...
112
Voted
CIE
2005
Springer
15 years 11 months 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...