Sciweavers

CVPR
2012
IEEE
11 years 6 months ago
What is optimized in tight convex relaxations for multi-label problems?
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
Christopher Zach, Christian Hane, Marc Pollefeys
SODA
1997
ACM
76views Algorithms» more  SODA 1997»
13 years 5 months ago
Markov Chains for Linear Extensions, the Two-Dimensional Case
We study the generation of uniformly distributed linear extensions using Markov chains. In particular we show that monotone coupling from the past can be applied in the case of lin...
Stefan Felsner, Lorenz Wernisch
RECOMB
2009
Springer
13 years 10 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
Sébastien Angibaud, Guillaume Fertin, Annel...