31 search results - page 5 / 7 » dm 2011 |
DM
2011
13 years 4 months ago
2011
We prove that any k-uniform hypergraph on n vertices with minimum degree at least n 2(k−1) + o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K...
HAIS
2011
Springer
13 years 1 months ago
2011
Springer
WEKA has recently become a very referenced DM tool. In spite of all the functionality it provides, it does not include any framework for the development of evolutionary algorithms....
DM
2011
13 years 1 months ago
2011
A relational first order structure is homogeneous if it is countable (possibly finite) and every isomorphism between finite substructures extends to an automorphism. This artic...
DM
2011
13 years 1 months ago
2011
We show that regular median graphs of linear growth are the Cartesian product of finite hypercubes with the two-way infinite path. Such graphs are Cayley graphs and have only tw...
DM
2011
13 years 4 months ago
2011
Archibald and Knopfmacher recently considered the largest missing value in a composition of an integer and established mean and variance. Our alternative, probabilistic approach p...