121 search results - page 21 / 25 » dm 2010 |
113
Voted
DM
2010
15 years 4 months ago
2010
For d 1, s 0 a (d,d +s)-graph is a graph whose degrees all lie in the interval {d,d +1,...,d +s}. For r 1, a 0 an (r,r+1)-factor of a graph G is a spanning (r,r+a)-subgraph of...
133
Voted
DM
2010
15 years 4 months ago
2010
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
159
Voted
DM
2011
14 years 7 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...
129
click to vote
CORR
2010
Springer
15 years 18 days ago
2010
Springer
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use opt...
167
click to vote
INCDM
2010
Springer
15 years 5 months ago
2010
Springer
We present rminer, our open source library for the R tool that facilitates the use of data mining (DM) algorithms, such as neural Networks (NNs) and support vector machines (SVMs),...