803 search results - page 42 / 161 » Independence in Direct-Product Graphs |
107
Voted
MOR
2007
15 years 5 days ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...
100
Voted
GC
2010
Springer
14 years 11 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
114
Voted
PERCOM
2011
ACM
14 years 4 months ago
2011
ACM
—The need to prolong the ability for older adults to live at home independently has become an important area of smart environment research. In this proposal, we demonstrate a web...
88
Voted
PAKDD
2010
ACM
15 years 5 months ago
2010
ACM
Both itemset mining and graph mining have been studied independently. Here, we introduce a novel data structure, which is an unweighted graph whose vertices contain itemsets. From ...
91
Voted
JMLR
2011
14 years 7 months ago
2011
We present a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variables, called cumulative distribution networks...