1480 search results - page 31 / 296 » Distributed algorithms for weighted problems in sparse graph... |
124
Voted
NIPS
2007
15 years 2 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
WADS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
115
click to vote
ISAAC
1998
Springer
15 years 5 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...
111
Voted
AAAI
2012
13 years 3 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
118
Voted
DAM
2000
15 years 19 days ago
2000
Given an undirected graph with a nonnegative weight on each edge, the shortest total path length spanning tree problem is to