373 search results - page 27 / 75 » Counting in Trees for Free |
CALCO
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we identify context-free grammars as coalgebras. To obtain the associated context-free languages (consisting of only finite-length strings) we introduce a general a...
ESA
2009
Springer
14 years 3 months 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...
ISMIS
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we propose an original approach to apply data mining algorithms, namely decision tree-based methods, taking into account not only the size of processed databases but ...
NETWORKS
2008
13 years 8 months ago
2008
In this paper, we develop a method to count the number of spanning trees in certain classes of double fixed-step loop networks with nonconstant steps. More specifically our techni...
PAKDD
2007
ACM
14 years 2 months ago
2007
ACM
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...