106 search results - page 17 / 22 » SDP-Based Algorithms for Maximum Independent Set Problems on... |
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
ICCAD
2003
IEEE
14 years 4 months ago
2003
IEEE
Heuristics are widely used for solving computational intractable synthesis problems. However, until now, there has been limited effort to systematically develop heuristics that ca...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
ANOR
2005
13 years 7 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
SIAMMAX
2010
13 years 2 months ago
2010
In this paper, we consider estimating sparse inverse covariance of a Gaussian graphical model whose conditional independence is assumed to be partially known. Similarly as in [5],...