39 results on '"Paul Swoboda"'
Search Results
2. DOGE-Train: Discrete Optimization on GPU with End-to-End Training.
3. A Multidimensional Analysis of Social Biases in Vision Transformers.
4. ClusterFuG: Clustering Fully connected Graphs by Multicut.
5. Joint Self-Supervised Image-Volume Representation Learning with Intra-inter Contrastive Clustering.
6. A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching.
7. LMGP: Lifted Multicut Meets Geometry Projections for Multi-Camera Multi-Object Tracking.
8. FastDOG: Fast Discrete Optimization on GPU.
9. RAMA: A Rapid Multicut Algorithm on GPU.
10. A Comparative Study of Graph Matching Algorithms in Computer Vision.
11. LVM-Med: Learning Large-Scale Self-Supervised Vision Models for Medical Imaging via Second-order Graph Matching.
12. Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths.
13. Combinatorial Optimization for Panoptic Segmentation: A Fully Differentiable Approach.
14. Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams.
15. A Primal-Dual Solver for Large-Scale Tracking-by-Assignment.
16. Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers.
17. Lifted Disjoint Paths with Application in Multiple Object Tracking.
18. HiPPI: Higher-Order Projected Power Iterations for Scalable Multi-Matching.
19. Bottleneck Potentials in Markov Random Fields.
20. MAP Inference via Block-Coordinate Frank-Wolfe Algorithm.
21. Combinatorial Persistency Criteria for Multicut and Max-Cut.
22. A Convex Relaxation for Multi-Graph Matching.
23. Exact MAP-Inference by Confining Combinatorial Search With LP Relaxation.
24. A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching.
25. A Message Passing Algorithm for the Minimum Cost Multicut Problem.
26. A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems.
27. Graphical Model Parameter Learning by Inverse Linear Programming.
28. A Novel Convex Relaxation for Non-binary Discrete Tomography.
29. Maximum persistency via iterative relaxed inference with graphical models.
30. Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts.
31. Partial Optimality by Pruning for MAP-Inference with General Graphical Models.
32. Anatomical landmark detection using multiple instance boosting with spatial regularization.
33. Variational Image Segmentation and Cosegmentation with the Wasserstein Distance.
34. Global MAP-Optimality by Shrinking the Combinatorial Search Area with Convex Relaxation.
35. Partial Optimality via Iterative Pruning for the Potts Model.
36. Moving Omega to an Object-Oriented Platform.
37. An Active Functional Intensional Database.
38. Open Problems in Distributed Communities.
39. Building Intensional Communities Using Shared Contexts.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.