1554 search results - page 30 / 311 » Parameterized Complexity and Approximation Algorithms |
ICLP
2001
Springer
15 years 2 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
SOFSEM
2009
Springer
15 years 7 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
IMR
2003
Springer
15 years 3 months ago
2003
Springer
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on ...
TOG
2002
14 years 9 months ago
2002
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
88
Voted
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...