ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1612.05441
  4. Cited By
A Message Passing Algorithm for the Minimum Cost Multicut Problem
v1v2 (latest)

A Message Passing Algorithm for the Minimum Cost Multicut Problem

16 December 2016
Paul Swoboda
Bjoern Andres
ArXiv (abs)PDFHTML

Papers citing "A Message Passing Algorithm for the Minimum Cost Multicut Problem"

14 / 14 papers shown
Title
Convergence of Some Convex Message Passing Algorithms to a Fixed Point
Convergence of Some Convex Message Passing Algorithms to a Fixed Point
Václav Voráček
Tomas Werner
55
0
0
07 Mar 2024
M3C: A Framework towards Convergent, Flexible, and Unsupervised Learning
  of Mixture Graph Matching and Clustering
M3C: A Framework towards Convergent, Flexible, and Unsupervised Learning of Mixture Graph Matching and Clustering
Jiaxin Lu
Zetian Jiang
Tianzhe Wang
Junchi Yan
133
1
0
27 Oct 2023
ClusterFuG: Clustering Fully connected Graphs by Multicut
ClusterFuG: Clustering Fully connected Graphs by Multicut
Ahmed Abbas
Paul Swoboda
71
3
0
28 Jan 2023
Learning to solve Minimum Cost Multicuts efficiently using Edge-Weighted
  Graph Convolutional Neural Networks
Learning to solve Minimum Cost Multicuts efficiently using Edge-Weighted Graph Convolutional Neural Networks
Steffen Jung
Margret Keuper
GNN
47
3
0
04 Apr 2022
Structured Prediction Problem Archive
Structured Prediction Problem Archive
Paul Swoboda
Bjoern Andres
Andrea Hornáková
Florian Bernard
Jannik Irmai
Paul Roetzer
Bogdan Savchynskyy
David Stein
Ahmed Abbas
79
7
0
04 Feb 2022
Optimizing Edge Detection for Image Segmentation with Multicut Penalties
Optimizing Edge Detection for Image Segmentation with Multicut Penalties
Steffen Jung
Sebastian Ziegler
Amirhossein Kardoost
Margret Keuper
64
4
0
10 Dec 2021
Correlation Clustering via Strong Triadic Closure Labeling: Fast
  Approximation Algorithms and Practical Lower Bounds
Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds
Nate Veldt
77
23
0
20 Nov 2021
FastDOG: Fast Discrete Optimization on GPU
FastDOG: Fast Discrete Optimization on GPU
Ahmed Abbas
Paul Swoboda
126
8
0
19 Nov 2021
RAMA: A Rapid Multicut Algorithm on GPU
RAMA: A Rapid Multicut Algorithm on GPU
A. Abbas
Paul Swoboda
92
9
0
04 Sep 2021
Uncertainty in Minimum Cost Multicuts for Image and Motion Segmentation
Uncertainty in Minimum Cost Multicuts for Image and Motion Segmentation
Amirhossein Kardoost
Margret Keuper
UQCV
120
3
0
16 May 2021
Discrete graphical models -- an optimization perspective
Discrete graphical models -- an optimization perspective
Bogdan Savchynskyy
71
26
0
24 Jan 2020
Massively Parallel Benders Decomposition for Correlation Clustering
Massively Parallel Benders Decomposition for Correlation Clustering
Margret Keuper
Jovita Lukasik
Maneesh Kumar Singh
Julian Yarkony
48
2
0
15 Feb 2019
End-to-end Learning for Graph Decomposition
End-to-end Learning for Graph Decomposition
Mingli Song
Bjoern Andres
Michael J. Black
Otmar Hilliges
Siyu Tang
47
16
0
23 Dec 2018
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial
  Problems
A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems
Paul Swoboda
Jan Kuske
Bogdan Savchynskyy
58
29
0
16 Dec 2016
1