Paul Swoboda
Kolmogorov Group
9 Publications
2019 | Conference Paper | IST-REx-ID: 7468 | 
Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.” Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2019–June, 11138–11147, IEEE, 2019, doi:10.1109/CVPR.2019.01140.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 703 |
Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 5978 |
Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–88.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Conference Paper | IST-REx-ID: 641
Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26.
View
| DOI
2017 | Conference Paper | IST-REx-ID: 646 |
Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 916 |
Swoboda, Paul, et al. A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:10.1109/CVPR.2017.747.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 915 |
Swoboda, Paul, and Bjoern Andres. A Message Passing Algorithm for the Minimum Cost Multicut Problem. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:10.1109/CVPR.2017.530.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 917 |
Swoboda, Paul, et al. A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems. Vol. 2017, IEEE, 2017, pp. 4950–60, doi:10.1109/CVPR.2017.526.
[Submitted Version]
View
| Files available
| DOI
| WoS
2016 | Research Data | IST-REx-ID: 5557 |
Swoboda, Paul. Synthetic Discrete Tomography Problems. Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:46.
[Published Version]
View
| Files available
| DOI
9 Publications
2019 | Conference Paper | IST-REx-ID: 7468 |
Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.” Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2019–June, 11138–11147, IEEE, 2019, doi:10.1109/CVPR.2019.01140.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 703 |
Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 5978 |
Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–88.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Conference Paper | IST-REx-ID: 641
Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26.
View
| DOI
2017 | Conference Paper | IST-REx-ID: 646 |
Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Conference Paper | IST-REx-ID: 916 |
Swoboda, Paul, et al. A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:10.1109/CVPR.2017.747.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 915 |
Swoboda, Paul, and Bjoern Andres. A Message Passing Algorithm for the Minimum Cost Multicut Problem. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:10.1109/CVPR.2017.530.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 917 |
Swoboda, Paul, et al. A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems. Vol. 2017, IEEE, 2017, pp. 4950–60, doi:10.1109/CVPR.2017.526.
[Submitted Version]
View
| Files available
| DOI
| WoS
2016 | Research Data | IST-REx-ID: 5557 |
Swoboda, Paul. Synthetic Discrete Tomography Problems. Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:46.
[Published Version]
View
| Files available
| DOI