3211 search results - page 509 / 643 » On the Grundy Number of a Graph |
UAI
2004
13 years 10 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...
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
Scheduling collective communications (CC) in networks based on optimal graphs and digraphs has been done with the use of the evolutionary techniques. Inter-node communication patt...
ICML
2010
IEEE
13 years 10 months ago
2010
IEEE
We develop a novel online learning algorithm for the group lasso in order to efficiently find the important explanatory factors in a grouped manner. Different from traditional bat...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...