1554 search results - page 22 / 311 » Parameterized Complexity and Approximation Algorithms |
111
click to vote
PG
2007
IEEE
15 years 4 months ago
2007
IEEE
We introduce an algorithm for approximating a 2manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of tria...
CVPR
1999
IEEE
16 years 2 days ago
1999
IEEE
A spatio-temporal representation for complex optical flow events is developed that generalizes traditional parameterized motion models (e.g. affine). These generative spatio-tempo...
ATAL
2010
Springer
14 years 11 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
ANTSW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
TAMC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...