982 search results - page 151 / 197 » Solving Steiner tree problems in graphs to optimality |
114
click to vote
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
Geometric rearrangement of images includes operations
such as image retargeting, inpainting, or object rearrangement.
Each such operation can be characterized by a shiftmap:
the...
84
Voted
GI
2007
Springer
15 years 6 months ago
2007
Springer
: This paper deals with the linear discrete-time sensor scheduling problem in unreliable communication networks. In case of the common assumption of an errorfree communication, the...
AAAI
1998
15 years 1 months ago
1998
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
133
Voted
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
106
click to vote
NIPS
2007
15 years 1 months ago
2007
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...