142 search results - page 11 / 29 » Approximate maximum weight branchings |
128
Voted
IPL
2007
15 years 1 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
113
click to vote
SODA
2001
ACM
15 years 3 months ago
2001
ACM
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
147
click to vote
PODC
2009
ACM
16 years 2 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...
139
click to vote
WDAG
2009
Springer
15 years 8 months ago
2009
Springer
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆ + 1)2 synchronous communication rounds,...
159
click to vote
ICIP
2001
IEEE
16 years 3 months ago
2001
IEEE
We present an approach to tracking human activities in a monocular video. We model the human body by decomposing it into torso and limbs and use simple 3D shapes to approximate th...