1404 search results - page 25 / 281 » Optimization problems in multiple-interval graphs |
184
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
153
click to vote
JMLR
2010
15 years 22 days ago
2010
We study the problem of learning an optimal Bayesian network in a constrained search space; skeletons are compelled to be subgraphs of a given undirected graph called the super-st...
159
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
157
Voted
CIMCA
2005
IEEE
15 years 11 months ago
2005
IEEE
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
174
click to vote
ESA
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...