547 search results - page 47 / 110 » dm 2008 |
101
click to vote
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
Motivated by the need for unification of the field of data mining and the growing demand for formalized representation of outcomes of research, we address the task of constructi...
DM
2008
15 years 1 months ago
2008
Let EN = (e1, e2, . . . , eN ) be a binary sequence with ei {+1, -1}. For 2 k N, the correlation measure of order k of the sequence is defined by Mauduit and S
DM
2008
15 years 1 months ago
2008
In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any ...
DM
2008
15 years 29 days ago
2008
We prove that the number of minimal transversals (and also the number of maximal independent sets) in a 3-uniform hypergraph with n vertices is at most cn , where c
108
click to vote
DM
2008
15 years 1 months ago
2008
Ore presented a degree condition involving every pair of nonadjacent vertices for a graph to be hamiltonian. Fan (J. Combin. Theory Ser. B 37 (1984) 221