3471 search results - page 552 / 695 » Obstacle Numbers of Graphs |
158
Voted
GECCO
2008
Springer
15 years 7 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...
160
Voted
ICML
2010
IEEE
15 years 7 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...
151
Voted
CORR
2010
Springer
15 years 6 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...
144
click to vote
CORR
2010
Springer
15 years 6 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...
149
Voted
ACTA
2006
15 years 6 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...