260 search results - page 5 / 52 » Hardness of Parameterized Resolution |
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
This paper develops a practical method for image resolution enhancement. The method optimizes the spatially constrained Wiener filter for an efficiently parameterized model of the...
COCOON
2000
Springer
13 years 12 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...