7129 search results - page 274 / 1426 » Approximation Algorithms for Treewidth |
122
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we propose an approximated structured prediction framework for large scale graphical models and derive message-passing algorithms for learning their parameters effic...
155
click to vote
ECCC
2000
15 years 4 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
112
click to vote
WINE
2009
Springer
15 years 11 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
175
click to vote
ILP
2004
Springer
15 years 9 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
129
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...