447 search results - page 65 / 90 » Approximation Algorithms for Directed Steiner Problems |
124
click to vote
ICCV
2005
IEEE
16 years 3 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
153
click to vote
STOC
2012
ACM
13 years 3 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
128
click to vote
WSCG
2004
15 years 2 months ago
2004
In this paper we describe a new method for improving the representation of textures in blends of multiple images based on a Markov Random Field (MRF) algorithm. We show that direc...
105
click to vote
JACM
2006
15 years 1 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
113
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...