3 search results - page 1 / 1 » Dynamic Programming on Tree Decompositions Using Generalised... |
ESA
2009
Springer
14 years 9 days ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
STACS
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
COCOON
2009
Springer
14 years 9 days ago
2009
Springer
In this paper, we deal with restoring missing information in molecule databases: Some data formats only store the atoms’ configuration but omit bond multiplicities. As this info...