260 search results - page 35 / 52 » Hardness of Parameterized Resolution |
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
DISOPT
2011
13 years 2 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We present a unifying approach to the efficient evaluation of propositional answer-set programs. Our approach is based on backdoors which are small sets of atoms that represent ...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
2010
Eurographics
Smoke animations are hard to art-direct because simple changes in parameters such as simulation resolution often lead to unpredictable changes in the final result. Previous work ...
IPSN
2010
Springer
14 years 2 months ago
2010
Springer
We present Virtual High-resolution Time (VHT), a powerproportional time-keeping service that offers a baseline power draw of a low-speed clock (e.g. 32 kHz crystal), but provides...