Sciweavers

1554 search results - page 21 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
TCS
2010
14 years 8 months ago
Iterative compression and exact algorithms
Iterative Compression has recently led to a number of breakthroughs in parameterized complexity. Here, we show that the technique can also be useful in the design of exact exponen...
Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mat...
APPROX
2000
Springer
84views Algorithms» more  APPROX 2000»
15 years 2 months ago
On the relative complexity of approximate counting problems
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
VC
2008
131views more  VC 2008»
14 years 10 months ago
Motion synthesis with decoupled parameterization
In real-time animation systems, motion interpolation techniques are widely used for their controllability and efficiency. The techniques sample the parameter space using example mo...
Dongwook Ha, JungHyun Han
IPL
2008
65views more  IPL 2008»
14 years 10 months ago
On the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be m...
Iain A. Stewart
ICPR
2008
IEEE
15 years 11 months ago
Vector field resampling using local streamline approximation
In this paper, we propose an algorithm to resample coarse vector fields in order to obtain vector fields of a higher density. Unlike the typical linear interpolation scheme, our a...
Mani Thomas, Chandra Kambhamettu, Cathleen A. Geig...