177 citations · 519 across the 32 of their papers we have counts for
4 papers · 1 filter
Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice
Erik Jenner, Enrique Fita Sanmartín, Fred A. Hamprecht
The minimum graph cut and minimum --cut problems are important primitives in the modeling of combinatorial problems in computer science, including in computer vision and mach…
Probabilistic Watershed: Sampling all spanning forests for seeded segmentation and semi-supervised learning
Enrique Fita Sanmartin, Sebastian Damrich, Fred A. Hamprecht
The seeded Watershed algorithm / minimax semi-supervised learning on a graph computes a minimum spanning forest which connects every pixel / unlabeled node to a seed / labeled node…
The Lazy Flipper: MAP Inference in Higher-Order Graphical Models by Depth-limited Exhaustive Search
Bjoern Andres, Joerg H. Kappes, Ullrich Koethe +1
This article presents a new search algorithm for the NP-hard problem of optimizing functions of binary variables that decompose according to a graphical model. It can be applied to…
Runtime-Flexible Multi-dimensional Arrays and Views for C++98 and C++0x
Bjoern Andres, Ullrich Koethe, Thorben Kroeger +1
Multi-dimensional arrays are among the most fundamental and most useful data structures of all. In C++, excellent template libraries exist for arrays whose dimension is fixed at ru…