3192 search results - page 389 / 639 » The minimum latency problem |
128
click to vote
APPROX
2010
Springer
15 years 5 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
120
click to vote
AAAI
2010
15 years 5 months ago
2010
This paper presents a novel recursive maximum a posteriori update for the Kalman formulation of undelayed bearing-only SLAM. The estimation update step is cast as an optimization ...
108
click to vote
CCCG
2008
15 years 5 months ago
2008
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
164
click to vote
UAI
2008
15 years 5 months ago
2008
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...
154
click to vote
UAI
2008
15 years 5 months ago
2008
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. As an extension of Welling and ...