9 Publications

Mark all

[9]
2019 | Conference Paper | IST-REx-ID: 7468 | OA
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.
View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 703 | OA
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.
View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2018 | Conference Paper | IST-REx-ID: 5978 | OA
Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI, 2018, pp. 6581–88.
View | Download Preprint (ext.) | arXiv
 
[6]
2017 | Conference Paper | IST-REx-ID: 915 | OA
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.
View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 916 | OA
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.
View | Files available | DOI
 
[4]
2017 | Conference Paper | IST-REx-ID: 917 | OA
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.
View | Files available | DOI
 
[3]
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
 
[2]
2017 | Conference Paper | IST-REx-ID: 646 | OA
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.
View | DOI | Download Submitted Version (ext.)
 
[1]
2016 | Research Data | IST-REx-ID: 5557 | OA
Swoboda, Paul. Synthetic Discrete Tomography Problems. IST Austria, 2016, doi:10.15479/AT:ISTA:46.
View | Files available | DOI
 

Search

Filter Publications

9 Publications

Mark all

[9]
2019 | Conference Paper | IST-REx-ID: 7468 | OA
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.
View | DOI | Download Preprint (ext.) | arXiv
 
[8]
2018 | Journal Article | IST-REx-ID: 703 | OA
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.
View | DOI | Download Preprint (ext.) | arXiv
 
[7]
2018 | Conference Paper | IST-REx-ID: 5978 | OA
Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI, 2018, pp. 6581–88.
View | Download Preprint (ext.) | arXiv
 
[6]
2017 | Conference Paper | IST-REx-ID: 915 | OA
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.
View | Files available | DOI
 
[5]
2017 | Conference Paper | IST-REx-ID: 916 | OA
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.
View | Files available | DOI
 
[4]
2017 | Conference Paper | IST-REx-ID: 917 | OA
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.
View | Files available | DOI
 
[3]
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
 
[2]
2017 | Conference Paper | IST-REx-ID: 646 | OA
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.
View | DOI | Download Submitted Version (ext.)
 
[1]
2016 | Research Data | IST-REx-ID: 5557 | OA
Swoboda, Paul. Synthetic Discrete Tomography Problems. IST Austria, 2016, doi:10.15479/AT:ISTA:46.
View | Files available | DOI
 

Search

Filter Publications