653 search results - page 35 / 131 » The size of minimum 3-trees |
BIRTHDAY
2009
Springer
15 years 6 months ago
2009
Springer
We introduce the weak gap property for directed graphs whose vertex set S is a metric space of size n. We prove that, if the doubling dimension of S is a constant, any directed gra...
EUROGP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this contribution we investigate the influence of different variation effects on the growth of code. A mutation-based variant of linear GP is applied that operates ...
CSDA
2007
14 years 11 months ago
2007
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
JMLR
2006
14 years 11 months ago
2006
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
IJAC
2007
14 years 11 months ago
2007
Abstract. Rotation distance quantifies the difference in shape between two rooted binary trees of the same size by counting the minimum number of elementary changes needed to tra...