3875 search results - page 190 / 775 » Approximation algorithms for the 0-extension problem |
149
click to vote
JAIR
2011
14 years 8 months ago
2011
We address the problem of computing approximate marginals in Gaussian probabilistic models by using mean field and fractional Bethe approximations. We define the Gaussian fracti...
127
click to vote
ICDM
2007
IEEE
15 years 11 months ago
2007
IEEE
We address a new learning problem where the goal is to build a predictive model that minimizes prediction time (the time taken to make a prediction) subject to a constraint on mod...
173
click to vote
ICALP
2004
Springer
15 years 10 months ago
2004
Springer
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
147
Voted
EOR
2008
15 years 5 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
180
click to vote
ISAAC
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...