715 search results - page 74 / 143 » On graphs with subgraphs having large independence numbers |
114
click to vote
IANDC
2008
14 years 12 months ago
2008
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
116
click to vote
MICS
2010
14 years 10 months ago
2010
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
UAI
2004
15 years 1 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
108
click to vote
SADM
2011
14 years 6 months ago
2011
Abstract: Visualizing data by graphing a response against certain factors, and conditioning on other factors, has arisen independently in many contexts. One is the interaction plot...