@article{2126, abstract = {Let K be an irreducible and reversible Markov kernel on a finite set X. We construct a metric W on the set of probability measures on X and show that with respect to this metric, the law of the continuous time Markov chain evolves as the gradient flow of the entropy. This result is a discrete counterpart of the Wasserstein gradient flow interpretation of the heat flow in Rn by Jordan, Kinderlehrer and Otto (1998). The metric W is similar to, but different from, the L2-Wasserstein metric, and is defined via a discrete variant of the Benamou–Brenier formula. }, author = {Jan Maas}, journal = {Journal of Functional Analysis}, number = {8}, pages = {2250 -- 2292}, publisher = {Academic Press}, title = {{Gradient flows of the entropy for finite Markov chains}}, doi = {10.1016/j.jfa.2011.06.009 }, volume = {261}, year = {2011}, } @unpublished{2138, abstract = {A (diatomic) shape resonance is a metastable state of a pair of colliding atoms quasi-bound by the centrifugal barrier imposed by the angular momentum involved in the collision. The temporary trapping of the atoms' scattering wavefunction corresponds to an enhanced atom pair density at low interatomic separations. This leads to larger overlap of the wavefunctions involved in a molecule formation process such as photoassociation, rendering the process more efficient. However, for an ensemble of atoms, the atom pair density will only be enhanced if the energy of the resonance comes close to the temperature of the atomic ensemble. Herein we explore the possibility of controlling the energy of a shape resonance by shifting it toward the temperature of atoms confined in a trap. The shifts are imparted by the interaction of non-resonant light with the anisotropic polarizability of the atom pair, which affects both the centrifugal barrier and the pair's rotational and vibrational levels. We find that at laser intensities of up to 5×109 W/cm2 the pair density is increased by one order of magnitude for 87Rb atoms at 100μK and by two orders of magnitude for 88Sr atoms at 20μK.}, author = {Ağanoğlu, Ruzin and Mikhail Lemeshko and Friedrich, Břetislav and González-Férez, Rosario and Koch, Christiane P}, booktitle = {Unknown}, publisher = {ArXiv}, title = {{Controlling a diatomic shape resonance with non-resonant light}}, year = {2011}, } @article{2198, abstract = {We show that dressing polar molecules with a far-off-resonant optical field leads to new types of intermolecular potentials, which undergo a crossover from the inverse power to oscillating behavior depending on the intermolecular distance, and whose parameters can be tuned by varying the laser intensity and wavelength. We present analytic expressions for the potential energy surfaces, thereby providing direct access to the parameters of an optical field required to design intermolecular interactions experimentally.}, author = {Mikhail Lemeshko}, journal = {Physical Review A - Atomic, Molecular, and Optical Physics}, number = {5}, publisher = {American Physical Society}, title = {{Shaping interactions between polar molecules with far-off-resonant light}}, doi = {10.1103/PhysRevA.83.051402}, volume = {83}, year = {2011}, } @article{14305, abstract = {Understanding the mechanism of protein folding requires a detailed knowledge of the structural properties of the barriers separating unfolded from native conformations. The S-peptide from ribonuclease S forms its α-helical structure only upon binding to the folded S-protein. We characterized the transition state for this binding-induced folding reaction at high resolution by determining the effect of site-specific backbone thioxylation and side-chain modifications on the kinetics and thermodynamics of the reaction, which allows us to monitor formation of backbone hydrogen bonds and side-chain interactions in the transition state. The experiments reveal that α-helical structure in the S-peptide is absent in the transition state of binding. Recognition between the unfolded S-peptide and the S-protein is mediated by loosely packed hydrophobic side-chain interactions in two well defined regions on the S-peptide. Close packing and helix formation occurs rapidly after binding. Introducing hydrophobic residues at positions outside the recognition region can drastically slow down association.}, author = {Bachmann, Annett and Wildemann, Dirk and Praetorius, Florian M and Fischer, Gunter and Kiefhaber, Thomas}, issn = {1091-6490}, journal = {PNAS}, keywords = {Multidisciplinary}, number = {10}, pages = {3952--3957}, publisher = {Proceedings of the National Academy of Sciences}, title = {{Mapping backbone and side-chain interactions in the transition state of a coupled protein folding and binding reaction}}, doi = {10.1073/pnas.1012668108}, volume = {108}, year = {2011}, } @article{1467, abstract = {We propose a general conjecture for the mixed Hodge polynomial of the generic character varieties of representations of the fundamental group of a Riemann surface of genus g to GLn(C) with fixed generic semisimple conjugacy classes at k punctures. This conjecture generalizes the Cauchy identity for Macdonald polynomials and is a common generalization of two formulas that we prove in this paper. The first is a formula for the E-polynomial of these character varieties which we obtain using the character table of GLn(Fq). We use this formula to compute the Euler characteristic of character varieties. The second formula gives the Poincaré polynomial of certain associated quiver varieties which we obtain using the character table of gln(Fq). In the last main result we prove that the Poincaré polynomials of the quiver varieties equal certain multiplicities in the tensor product of irreducible characters of GLn(Fq). As a consequence we find a curious connection between Kac-Moody algebras associated with comet-shaped, and typically wild, quivers and the representation theory of GLn(Fq).}, author = {Tamas Hausel and Letellier, Emmanuel and Rodríguez Villegas, Fernando}, journal = {Duke Mathematical Journal}, number = {2}, pages = {323 -- 400}, publisher = {Duke University Press}, title = {{Arithmetic harmonic analysis on character and quiver varieties}}, doi = {10.1215/00127094-1444258}, volume = {160}, year = {2011}, } @article{1863, abstract = {The Levene model is the simplest mathematical model to describe the evolution of gene frequencies in spatially subdivided populations. It provides insight into how locally varying selection promotes a population’s genetic diversity. Despite its simplicity, interesting problems have remained unsolved even in the diallelic case. In this paper we answer an open problem by establishing that for two alleles at one locus and J demes, up to 2J−1 polymorphic equilibria may coexist. We first present a proof for the case of stable monomorphisms and then show that the result also holds for protected alleles. These findings allow us to prove that any odd number (up to 2J−1) of equilibria is possible, before we extend the proof to even numbers. We conclude with some numerical results and show that for J>2, the proportion of parameter space affording this maximum is extremely small.}, author = {Sebastian Novak}, journal = {Theoretical Population Biology}, number = {3}, pages = {97 -- 101}, publisher = {Academic Press}, title = {{The number of equilibria in the diallelic Levene model with multiple demes}}, doi = {10.1016/j.tpb.2010.12.002}, volume = {79}, year = {2011}, } @article{1973, abstract = {Complex I is the first and largest enzyme of the respiratory chain, coupling electron transfer between NADH and ubiquinone to the translocation of four protons across the membrane. It has a central role in cellular energy production and has been implicated in many human neurodegenerative diseases. The L-shaped enzyme consists of hydrophilic and membrane domains. Previously, we determined the structure of the hydrophilic domain. Here we report the crystal structure of the Esherichia coli complex I membrane domain at 3.0 Ã. resolution. It includes six subunits, NuoL, NuoM, NuoN, NuoA, NuoJ and NuoK, with 55 transmembrane helices. The fold of the homologous antiporter-like subunits L, M and N is novel, with two inverted structural repeats of five transmembrane helices arranged, unusually, face-to-back. Each repeat includes a discontinuous transmembrane helix and forms half of a channel across the membrane. A network of conserved polar residues connects the two half-channels, completing the proton translocation pathway. Unexpectedly, lysines rather than carboxylate residues act as the main elements of the proton pump in these subunits. The fourth probable proton-translocation channel is at the interface of subunits N, K, J and A. The structure indicates that proton translocation in complex I, uniquely, involves coordinated conformational changes in six symmetrical structural elements.}, author = {Efremov, Rouslan G and Leonid Sazanov}, journal = {Nature}, number = {7361}, pages = {414 -- 421}, publisher = {Nature Publishing Group}, title = {{Structure of the membrane domain of respiratory complex i}}, doi = {10.1038/nature10330}, volume = {476}, year = {2011}, } @article{1974, abstract = {Complex I is the first enzyme of the respiratory chain and plays a central role in cellular energy production. It has been implicated in many human neurodegenerative diseases, as well as in ageing. One of the biggest membrane protein complexes, it is an L-shaped assembly consisting of hydrophilic and membrane domains. Previously, we have determined structures of the hydrophilic domain in several redox states. Last year was marked by fascinating breakthroughs in the understanding of the complete structure. We described the architecture of the membrane domain and of the entire bacterial complex I. X-ray analysis of the larger mitochondrial enzyme has also been published. The core subunits of the bacterial and mitochondrial enzymes have remarkably similar structures. The proposed mechanism of coupling between electron transfer and proton translocation involves long-range conformational changes, coordinated in part by a long α-helix, akin to the coupling rod of a steam engine.}, author = {Efremov, Rouslan G and Leonid Sazanov}, journal = {Current Opinion in Structural Biology}, number = {4}, pages = {532 -- 540}, publisher = {Elsevier}, title = {{Respiratory complex I: 'steam engine' of the cell?}}, doi = {10.1016/j.sbi.2011.07.002}, volume = {21}, year = {2011}, } @article{1975, abstract = {Modern α-proteobacteria are thought to be closely related to the ancient symbiont of eukaryotes, an ancestor of mitochondria. Respiratory complex I from α-proteobacteria and mitochondria is well conserved at the level of the 14 "core" subunits, consistent with that notion. Mitochondrial complex I contains the core subunits, present in all species, and up to 31 "supernumerary" subunits, generally thought to have originated only within eukaryotic lineages. However, the full protein composition of an α-proteobacterial complex I has not been established previously. Here, we report the first purification and characterization of complex I from the α-proteobacterium Paracoccus denitrificans. Single particle electron microscopy shows that the complex has a well defined L-shape. Unexpectedly, in addition to the 14 core subunits, the enzyme also contains homologues of three supernumerary mitochondrial subunits as follows: B17.2, AQDQ/18, and 13 kDa (bovine nomenclature). This finding suggests that evolution of complex I via addition of supernumerary or "accessory" subunits started before the original endosymbiotic event that led to the creation of the eukaryotic cell. It also provides further confirmation that α-proteobacteria are the closest extant relatives of mitochondria.}, author = {Yip, Chui Y and Harbour, Michael E and Jayawardena, Kamburapola G and Fearnley, Ian M and Leonid Sazanov}, journal = {Journal of Biological Chemistry}, number = {7}, pages = {5023 -- 5033}, publisher = {American Society for Biochemistry and Molecular Biology}, title = {{Evolution of respiratory complex I "Supernumerary" subunits are present in the α-proteobacterial enzyme}}, doi = {10.1074/jbc.M110.194993}, volume = {286}, year = {2011}, } @article{469, abstract = {Spontaneous release of glutamate is important for maintaining synaptic strength and controlling spike timing in the brain. Mechanisms regulating spontaneous exocytosis remain poorly understood. Extracellular calcium concentration ([Ca2+]o) regulates Ca2+ entry through voltage-activated calcium channels (VACCs) and consequently is a pivotal determinant of action potential-evoked vesicle fusion. Extracellular Ca 2+ also enhances spontaneous release, but via unknown mechanisms. Here we report that external Ca2+ triggers spontaneous glutamate release more weakly than evoked release in mouse neocortical neurons. Blockade of VACCs has no effect on the spontaneous release rate or its dependence on [Ca2+]o. Intracellular [Ca2+] slowly increases in a minority of neurons following increases in [Ca2+]o. Furthermore, the enhancement of spontaneous release by extracellular calcium is insensitive to chelation of intracellular calcium by BAPTA. Activation of the calcium-sensing receptor (CaSR), a G-protein-coupled receptor present in nerve terminals, by several specific agonists increased spontaneous glutamate release. The frequency of spontaneous synaptic transmission was decreased in CaSR mutant neurons. The concentration-effect relationship for extracellular calcium regulation of spontaneous release was well described by a combination of CaSR-dependent and CaSR-independent mechanisms. Overall these results indicate that extracellular Ca2+ does not trigger spontaneous glutamate release by simply increasing calcium influx but stimulates CaSR and thereby promotes resting spontaneous glutamate release. }, author = {Vyleta, Nicholas and Smith, Stephen}, journal = {European Journal of Neuroscience}, number = {12}, pages = {4593 -- 4606}, publisher = {Wiley-Blackwell}, title = {{Spontaneous glutamate release is independent of calcium influx and tonically activated by the calcium-sensing receptor}}, doi = {10.1523/JNEUROSCI.6398-10.2011}, volume = {31}, year = {2011}, } @article{490, abstract = {BioSig is an open source software library for biomedical signal processing. The aim of the BioSig project is to foster research in biomedical signal processing by providing free and open source software tools for many different application areas. Some of the areas where BioSig can be employed are neuroinformatics, brain-computer interfaces, neurophysiology, psychology, cardiovascular systems, and sleep research. Moreover, the analysis of biosignals such as the electroencephalogram (EEG), electrocorticogram (ECoG), electrocardiogram (ECG), electrooculogram (EOG), electromyogram (EMG), or respiration signals is a very relevant element of the BioSig project. Specifically, BioSig provides solutions for data acquisition, artifact processing, quality control, feature extraction, classification, modeling, and data visualization, to name a few. In this paper, we highlight several methods to help students and researchers to work more efficiently with biomedical signals. }, author = {Schlögl, Alois and Vidaurre, Carmen and Sander, Tilmann}, journal = {Computational Intelligence and Neuroscience}, publisher = {Hindawi Publishing Corporation}, title = {{BioSig: The free and open source software library for biomedical signal processing}}, doi = {10.1155/2011/935364}, volume = {2011}, year = {2011}, } @article{491, abstract = {In their search for antigens, lymphocytes continuously shuttle among blood vessels, lymph vessels, and lymphatic tissues. Chemokines mediate entry of lymphocytes into lymphatic tissues, and sphingosine 1-phosphate (S1P) promotes localization of lymphocytes to the vasculature. Both signals are sensed through G protein-coupled receptors (GPCRs). Most GPCRs undergo ligand-dependent homologous receptor desensitization, a process that decreases their signaling output after previous exposure to high ligand concentration. Such desensitization can explain why lymphocytes do not take an intermediate position between two signals but rather oscillate between them. The desensitization of S1P receptor 1 (S1PR1) is mediated by GPCR kinase 2 (GRK2). Deletion of GRK2 in lymphocytes compromises desensitization by high vascular S1P concentrations, thereby reducing responsiveness to the chemokine signal and trapping the cells in the vascular compartment. The desensitization kinetics of S1PR1 allows lymphocytes to dynamically shuttle between vasculature and lymphatic tissue, although the positional information in both compartments is static.}, author = {Eichner, Alexander and Sixt, Michael K}, journal = {Science Signaling}, number = {198}, publisher = {American Association for the Advancement of Science}, title = {{Setting the clock for recirculating lymphocytes}}, doi = {10.1126/scisignal.2002617}, volume = {4}, year = {2011}, } @article{518, abstract = {Cancer stem cells or cancer initiating cells are believed to contribute to cancer recurrence after therapy. MicroRNAs (miRNAs) are short RNA molecules with fundamental roles in gene regulation. The role of miRNAs in cancer stem cells is only poorly understood. Here, we report miRNA expression profiles of glioblastoma stem cell-containing CD133 + cell populations. We find that miR-9, miR-9 * (referred to as miR-9/9 *), miR-17 and miR-106b are highly abundant in CD133 + cells. Furthermore, inhibition of miR-9/9 * or miR-17 leads to reduced neurosphere formation and stimulates cell differentiation. Calmodulin-binding transcription activator 1 (CAMTA1) is a putative transcription factor, which induces the expression of the anti-proliferative cardiac hormone natriuretic peptide A (NPPA). We identify CAMTA1 as an miR-9/9 * and miR-17 target. CAMTA1 expression leads to reduced neurosphere formation and tumour growth in nude mice, suggesting that CAMTA1 can function as tumour suppressor. Consistently, CAMTA1 and NPPA expression correlate with patient survival. Our findings could provide a basis for novel strategies of glioblastoma therapy.}, author = {Schraivogel, Daniel and Weinmann, Lasse and Beier, Dagmar and Tabatabai, Ghazaleh and Eichner, Alexander and Zhu, Jia and Anton, Martina and Sixt, Michael K and Weller, Michael and Beier, Christoph and Meister, Gunter}, journal = {EMBO Journal}, number = {20}, pages = {4309 -- 4322}, publisher = {Wiley-Blackwell}, title = {{CAMTA1 is a novel tumour suppressor regulated by miR-9/9 * in glioblastoma stem cells}}, doi = {10.1038/emboj.2011.301}, volume = {30}, year = {2011}, } @article{531, abstract = {Software transactional memories (STM) are described in the literature with assumptions of sequentially consistent program execution and atomicity of high level operations like read, write, and abort. However, in a realistic setting, processors use relaxed memory models to optimize hardware performance. Moreover, the atomicity of operations depends on the underlying hardware. This paper presents the first approach to verify STMs under relaxed memory models with atomicity of 32 bit loads and stores, and read-modify-write operations. We describe RML, a simple language for expressing concurrent programs. We develop a semantics of RML parametrized by a relaxed memory model. We then present our tool, FOIL, which takes as input the RML description of an STM algorithm restricted to two threads and two variables, and the description of a memory model, and automatically determines the locations of fences, which if inserted, ensure the correctness of the restricted STM algorithm under the given memory model. We use FOIL to verify DSTM, TL2, and McRT STM under the memory models of sequential consistency, total store order, partial store order, and relaxed memory order for two threads and two variables. Finally, we extend the verification results for DSTM and TL2 to an arbitrary number of threads and variables by manually proving that the structural properties of STMs are satisfied at the hardware level of atomicity under the considered relaxed memory models.}, author = {Guerraoui, Rachid and Henzinger, Thomas A and Singh, Vasu}, journal = {Formal Methods in System Design}, number = {3}, pages = {297 -- 331}, publisher = {Springer}, title = {{Verification of STM on relaxed memory models}}, doi = {10.1007/s10703-011-0131-3}, volume = {39}, year = {2011}, } @misc{5379, abstract = {Computing the winning set for Büchi objectives in alternating games on graphs is a central problem in computer aided verification with a large number of applications. The long standing best known upper bound for solving the problem is ̃O(n·m), where n is the number of vertices and m is the number of edges in the graph. We are the first to break the ̃O(n·m) boundary by presenting a new technique that reduces the running time to O(n2). This bound also leads to O(n2) time algorithms for computing the set of almost-sure winning vertices for Büchi objectives (1) in alternating games with probabilistic transitions (improving an earlier bound of O(n·m)), (2) in concurrent graph games with constant actions (improving an earlier bound of O(n3)), and (3) in Markov decision processes (improving for m > n4/3 an earlier bound of O(min(m1.5, m·n2/3)). We also show that the same technique can be used to compute the maximal end-component decomposition of a graph in time O(n2), which is an improvement over earlier bounds for m > n4/3. Finally, we show how to maintain the winning set for Büchi objectives in alternating games under a sequence of edge insertions or a sequence of edge deletions in O(n) amortized time per operation. This is the first dynamic algorithm for this problem.}, author = {Chatterjee, Krishnendu and Henzinger, Monika H}, issn = {2664-1690}, pages = {20}, publisher = {IST Austria}, title = {{An O(n2) time algorithm for alternating Büchi games}}, doi = {10.15479/AT:IST-2011-0009}, year = {2011}, } @misc{5380, abstract = {We consider 2-player games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine the successor state. We study concurrent games with ω-regular winning conditions specified as parity objectives. We consider the qualitative analysis problems: the computation of the almost-sure and limit-sure winning set of states, where player 1 can ensure to win with probability 1 and with probability arbitrarily close to 1, respectively. In general the almost-sure and limit-sure winning strategies require both infinite-memory as well as infinite-precision (to describe probabilities). We study the bounded-rationality problem for qualitative analysis of concurrent parity games, where the strategy set for player 1 is restricted to bounded-resource strategies. In terms of precision, strategies can be deterministic, uniform, finite-precision or infinite-precision; and in terms of memory, strategies can be memoryless, finite-memory or infinite-memory. We present a precise and complete characterization of the qualitative winning sets for all combinations of classes of strategies. In particular, we show that uniform memoryless strategies are as powerful as finite-precision infinite-memory strategies, and infinite-precision memoryless strategies are as powerful as infinite-precision finite-memory strategies. We show that the winning sets can be computed in O(n2d+3) time, where n is the size of the game structure and 2d is the number of priorities (or colors), and our algorithms are symbolic. The membership problem of whether a state belongs to a winning set can be decided in NP ∩ coNP. While this complexity is the same as for the simpler class of turn-based parity games, where in each state only one of the two players has a choice of moves, our algorithms,that are obtained by characterization of the winning sets as μ-calculus formulas, are considerably more involved than those for turn-based games.}, author = {Chatterjee, Krishnendu}, issn = {2664-1690}, pages = {53}, publisher = {IST Austria}, title = {{Bounded rationality in concurrent parity games}}, doi = {10.15479/AT:IST-2011-0008}, year = {2011}, } @misc{5382, abstract = {We consider two-player stochastic games played on a finite state space for an infinite num- ber of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously; the current state and the two moves determine a probability distribution over the successor states. We also consider the important special case of turn-based stochastic games where players make moves in turns, rather than concurrently. We study concurrent games with ω-regular winning conditions specified as parity objectives. The value for player 1 for a parity objective is the maximal probability with which the player can guarantee the satisfaction of the objective against all strategies of the opponent. We study the problem of continuity and robustness of the value function in concurrent and turn-based stochastic parity games with respect to imprecision in the transition probabilities. We present quantitative bounds on the difference of the value function (in terms of the imprecision of the transition probabilities) and show the value continuity for structurally equivalent concurrent games (two games are structurally equivalent if the support of the transition func- tion is same and the probabilities differ). We also show robustness of optimal strategies for structurally equivalent turn-based stochastic parity games. Finally we show that the value continuity property breaks without the structurally equivalent assumption (even for Markov chains) and show that our quantitative bound is asymptotically optimal. Hence our results are tight (the assumption is both necessary and sufficient) and optimal (our quantitative bound is asymptotically optimal).}, author = {Chatterjee, Krishnendu}, issn = {2664-1690}, pages = {18}, publisher = {IST Austria}, title = {{Robustness of structurally equivalent concurrent parity games}}, doi = {10.15479/AT:IST-2011-0006}, year = {2011}, } @misc{5383, abstract = {We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic second-order logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures.}, author = {Wies, Thomas and Muñiz, Marco and Kuncak, Viktor}, issn = {2664-1690}, pages = {25}, publisher = {IST Austria}, title = {{On an efficient decision procedure for imperative tree data structures}}, doi = {10.15479/AT:IST-2011-0005}, year = {2011}, } @misc{5384, abstract = {We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether for every ε > 0 there is a word that is accepted with probability at least 1 − ε. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions.}, author = {Chatterjee, Krishnendu and Tracol, Mathieu}, issn = {2664-1690}, pages = {30}, publisher = {IST Austria}, title = {{Decidable problems for probabilistic automata on infinite words}}, doi = {10.15479/AT:IST-2011-0004}, year = {2011}, } @misc{5386, abstract = {We introduce TopoCut: a new way to integrate knowledge about topological properties (TPs) into random field image segmentation model. Instead of including TPs as additional constraints during minimization of the energy function, we devise an efficient algorithm for modifying the unary potentials such that the resulting segmentation is guaranteed with the desired properties. Our method is more flexible in the sense that it handles more topology constraints than previous methods, which were only able to enforce pairwise or global connectivity. In particular, our method is very fast, making it for the first time possible to enforce global topological properties in practical image segmentation tasks.}, author = {Chen, Chao and Freedman, Daniel and Lampert, Christoph}, issn = {2664-1690}, pages = {69}, publisher = {IST Austria}, title = {{Enforcing topological constraints in random field image segmentation}}, doi = {10.15479/AT:IST-2011-0002}, year = {2011}, }