296 search results - page 54 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
UAI
2004
14 years 11 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...
JAL
1998
14 years 9 months ago
1998
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construct...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
112
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...