1554 search results - page 12 / 311 » Parameterized Complexity and Approximation Algorithms |
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
COLT
1993
Springer
14 years 19 days ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
AAAI
2008
13 years 11 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
WG
2009
Springer
14 years 3 months ago
2009
Springer
We study the parameterized complexity of several minimum label graph problems, in which we are given an undirected graph whose edges are labeled, and a property Π, and we are ask...
CAD
2004
Springer
13 years 8 months ago
2004
Springer
This paper presents a novel approach for 3D surface filtering over two-manifold meshes. A robust spherical parameterization algorithm is proposed to transform the input surface in...