Skip to content
conftrace_

Paul Swoboda

30 papers · 2013–2026 · 8 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Jump to papers ↓
+9 more ↓ πŸ—ΊοΈ Taxonomy Completionist (49) πŸƒ Academic Marathon Β· Half 🌍 Conference Polyglot Β· Silver πŸŒ‰ Interdisciplinary Bridge Β· Gold 🐣 Hot Topic Early Bird
πŸ† Keyword Champion (4) 🧬 Topic Evolution πŸ”¬ Deep Specialist (18) πŸ’Ž Century Club Β· Bronze πŸ”₯ Unstoppable Β· Bronze 🌈 Renaissance Researcher (6) ⚑ Prolific Year Β· Productive πŸ—ƒοΈ Keyword Collector (121) πŸ“ˆ Trend Setter

Papers

PIAST: Rapid Prompting with In-context Augmentation for Scarce Training data ACL 2026 A Mechanistic Analysis of a Transformer Trained on a Symbolic Multi-Step Reasoning Task ACL 2024 DiscoMatch: Fast Discrete Optimisation for Geometrically Consistent 3D Shape Matching ECCV 2024 DOGE-Train: Discrete Optimization on GPU with End-to-End Training AAAI 2024 A Multidimensional Analysis of Social Biases in Vision Transformers ICCV 2023 ClusterFuG: Clustering Fully connected Graphs by Multicut ICML 2023 Joint Self-Supervised Image-Volume Representation Learning with Intra-inter Contrastive Clustering AAAI 2023 LVM-Med: Learning Large-Scale Self-Supervised Vision Models for Medical Imaging via Second-order Graph Matching NeurIPS 2023 A Comparative Study of Graph Matching Algorithms in Computer Vision ECCV 2022 A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching CVPR 2022 FastDOG: Fast Discrete Optimization on GPU CVPR 2022 LMGP: Lifted Multicut Meets Geometry Projections for Multi-Camera Multi-Object Tracking CVPR 2022 RAMA: A Rapid Multicut Algorithm on GPU CVPR 2022 Combinatorial Optimization for Panoptic Segmentation: A Fully Differentiable Approach NeurIPS 2021 Efficient Message Passing for 0–1 ILPs with Binary Decision Diagrams ICML 2021 Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths ICCV 2021 A Primal-Dual Solver for Large-Scale Tracking-by-Assignment AISTATS 2020 Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers ECCV 2020 Lifted Disjoint Paths with Application in Multiple Object Tracking ICML 2020 A Convex Relaxation for Multi-Graph Matching CVPR 2019 Bottleneck Potentials in Markov Random Fields ICCV 2019 Combinatorial Persistency Criteria for Multicut and Max-Cut CVPR 2019 HiPPI: Higher-Order Projected Power Iterations for Scalable Multi-Matching ICCV 2019 MAP Inference via Block-Coordinate Frank-Wolfe Algorithm CVPR 2019 A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems CVPR 2017 A Message Passing Algorithm for the Minimum Cost Multicut Problem CVPR 2017 A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching CVPR 2017 Maximum Persistency via Iterative Relaxed Inference With Graphical Models CVPR 2015 Partial Optimality by Pruning for MAP-inference with General Graphical Models CVPR 2014 Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation NeurIPS 2013