7930 search results - page 697 / 1586 » Greedy in Approximation Algorithms |
248
click to vote
MEMICS
2010
15 years 2 months ago
2010
In this paper, we propose a modification to the Boykov-Kolmogorov maximum flow algorithm [2] in order to make the algorithm preserve the topology of an initial interface. This alg...
249
click to vote
PODS
2012
ACM
13 years 10 months ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
200
click to vote
CVPR
2006
IEEE
16 years 9 months ago
2006
IEEE
Stereo matching algorithms conventionally match over a range of disparities sufficient to encompass all visible 3D scene points. Human vision however does not do this. It works ov...
223
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
Unique games are constraint satisfaction problems that can be viewed as a generalization of Max-Cut to a larger domain size. The Unique Games Conjecture states that it is hard to ...
179
click to vote
APLAS
2009
ACM
16 years 1 months ago
2009
ACM
We present a simple algorithmic extension of the classical call-strings approach to mitigate substantial performance degradation caused by spurious interprocedural cycles. Spuriou...