96 search results - page 14 / 20 » On the Complexity of Deciding Avoidability of Sets of Partia... |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
BMCBI
2010
13 years 7 months ago
2010
Background: A growing demand for tools to assist the building and analysis of biological networks exists in systems biology. We argue that the use of a formal approach is relevant...
PARCO
2003
13 years 9 months ago
2003
Three different partial differential equation (PDE) solver kernels are analyzed in respect to cache memory performance on a simulated shared memory computer. The kernels implement...
PUC
2010
13 years 6 months ago
2010
We propose and investigate a paradigm for activity recognition, distinguishing the ‘on-going activity’ recognition task (OGA) from that addressing ‘complete activities’ (C...
IJAR
2010
13 years 6 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...