--- _id: '916' abstract: - lang: eng text: We study the quadratic assignment problem, in computer vision also known as graph matching. Two leading solvers for this problem optimize the Lagrange decomposition duals with sub-gradient and dual ascent (also known as message passing) updates. We explore this direction further and propose several additional Lagrangean relaxations of the graph matching problem along with corresponding algorithms, which are all based on a common dual ascent framework. Our extensive empirical evaluation gives several theoretical insights and suggests a new state-of-the-art anytime solver for the considered problem. Our improvement over state-of-the-art is particularly visible on a new dataset with large-scale sparse problem instances containing more than 500 graph nodes each. article_processing_charge: No author: - first_name: Paul full_name: Swoboda, Paul id: 446560C6-F248-11E8-B48F-1D18A9856A87 last_name: Swoboda - first_name: Carsten full_name: Rother, Carsten last_name: Rother - first_name: Carsten full_name: Abu Alhaija, Carsten last_name: Abu Alhaija - first_name: Dagmar full_name: Kainmueller, Dagmar last_name: Kainmueller - first_name: Bogdan full_name: Savchynskyy, Bogdan last_name: Savchynskyy citation: ama: 'Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol 2017. IEEE; 2017:7062-7071. doi:10.1109/CVPR.2017.747' apa: 'Swoboda, P., Rother, C., Abu Alhaija, C., Kainmueller, D., & Savchynskyy, B. (2017). A study of lagrangean decompositions and dual ascent solvers for graph matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.747' chicago: Swoboda, Paul, Carsten Rother, Carsten Abu Alhaija, Dagmar Kainmueller, and Bogdan Savchynskyy. “A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching,” 2017:7062–71. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.747. ieee: 'P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, and B. Savchynskyy, “A study of lagrangean decompositions and dual ascent solvers for graph matching,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 7062–7071.' ista: 'Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. 2017. A study of lagrangean decompositions and dual ascent solvers for graph matching. CVPR: Computer Vision and Pattern Recognition vol. 2017, 7062–7071.' mla: 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. short: P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071. conference: end_date: 2017-07-26 location: Honolulu, HA, United States name: 'CVPR: Computer Vision and Pattern Recognition' start_date: 2017-07-21 date_created: 2018-12-11T11:49:11Z date_published: 2017-01-01T00:00:00Z date_updated: 2023-09-26T15:41:40Z day: '01' ddc: - '000' department: - _id: VlKo doi: 10.1109/CVPR.2017.747 ec_funded: 1 external_id: isi: - '000418371407018' file: - access_level: open_access checksum: e38a2740daad1ea178465843b5072906 content_type: application/pdf creator: dernst date_created: 2019-01-18T12:49:38Z date_updated: 2020-07-14T12:48:15Z file_id: '5848' file_name: 2017_CVPR_Swoboda2.pdf file_size: 944332 relation: main_file file_date_updated: 2020-07-14T12:48:15Z has_accepted_license: '1' intvolume: ' 2017' isi: 1 language: - iso: eng month: '01' oa: 1 oa_version: Submitted Version page: 7062-7071 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication_identifier: isbn: - 978-153860457-1 publication_status: published publisher: IEEE publist_id: '6525' quality_controlled: '1' scopus_import: '1' status: public title: A study of lagrangean decompositions and dual ascent solvers for graph matching type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2017 year: '2017' ... --- _id: '915' abstract: - lang: eng text: We propose a dual decomposition and linear program relaxation of the NP-hard minimum cost multicut problem. Unlike other polyhedral relaxations of the multicut polytope, it is amenable to efficient optimization by message passing. Like other polyhedral relaxations, it can be tightened efficiently by cutting planes. We define an algorithm that alternates between message passing and efficient separation of cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art algorithms based on linear programming, including algorithms written in the framework of leading commercial software, as we show in experiments with large instances of the problem from applications in computer vision, biomedical image analysis and data mining. article_processing_charge: No author: - first_name: Paul full_name: Swoboda, Paul id: 446560C6-F248-11E8-B48F-1D18A9856A87 last_name: Swoboda - first_name: Bjoern full_name: Andres, Bjoern last_name: Andres citation: ama: 'Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530' apa: 'Swoboda, P., & Andres, B. (2017). A message passing algorithm for the minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.530' chicago: Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the Minimum Cost Multicut Problem,” 2017:4990–99. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.530. ieee: 'P. Swoboda and B. Andres, “A message passing algorithm for the minimum cost multicut problem,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4990–4999.' ista: 'Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.' mla: 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. short: P. Swoboda, B. Andres, in:, IEEE, 2017, pp. 4990–4999. conference: end_date: 2017-07-26 location: Honolulu, HA, United States name: 'CVPR: Computer Vision and Pattern Recognition' start_date: 2017-07-21 date_created: 2018-12-11T11:49:11Z date_published: 2017-07-01T00:00:00Z date_updated: 2023-09-26T15:43:27Z day: '01' ddc: - '000' department: - _id: VlKo doi: 10.1109/CVPR.2017.530 ec_funded: 1 external_id: isi: - '000418371405009' file: - access_level: open_access checksum: 7e51dacefa693574581a32da3eff63dc content_type: application/pdf creator: dernst date_created: 2019-01-18T12:52:46Z date_updated: 2020-07-14T12:48:15Z file_id: '5849' file_name: Swoboda_A_Message_Passing_CVPR_2017_paper.pdf file_size: 883264 relation: main_file file_date_updated: 2020-07-14T12:48:15Z has_accepted_license: '1' intvolume: ' 2017' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 4990-4999 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication_identifier: isbn: - 978-153860457-1 publication_status: published publisher: IEEE publist_id: '6526' quality_controlled: '1' scopus_import: '1' status: public title: A message passing algorithm for the minimum cost multicut problem type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2017 year: '2017' ... --- _id: '917' abstract: - lang: eng text: We propose a general dual ascent framework for Lagrangean decomposition of combinatorial problems. Although methods of this type have shown their efficiency for a number of problems, so far there was no general algorithm applicable to multiple problem types. In this work, we propose such a general algorithm. It depends on several parameters, which can be used to optimize its performance in each particular setting. We demonstrate efficacy of our method on graph matching and multicut problems, where it outperforms state-of-the-art solvers including those based on subgradient optimization and off-the-shelf linear programming solvers. article_processing_charge: No author: - first_name: Paul full_name: Swoboda, Paul id: 446560C6-F248-11E8-B48F-1D18A9856A87 last_name: Swoboda - first_name: Jan full_name: Kuske, Jan last_name: Kuske - first_name: Bogdan full_name: Savchynskyy, Bogdan last_name: Savchynskyy citation: ama: 'Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:10.1109/CVPR.2017.526' apa: 'Swoboda, P., Kuske, J., & Savchynskyy, B. (2017). A dual ascent framework for Lagrangean decomposition of combinatorial problems (Vol. 2017, pp. 4950–4960). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.526' chicago: Swoboda, Paul, Jan Kuske, and Bogdan Savchynskyy. “A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems,” 2017:4950–60. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.526. ieee: 'P. Swoboda, J. Kuske, and B. Savchynskyy, “A dual ascent framework for Lagrangean decomposition of combinatorial problems,” presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States, 2017, vol. 2017, pp. 4950–4960.' ista: 'Swoboda P, Kuske J, Savchynskyy B. 2017. A dual ascent framework for Lagrangean decomposition of combinatorial problems. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4950–4960.' mla: 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. short: P. Swoboda, J. Kuske, B. Savchynskyy, in:, IEEE, 2017, pp. 4950–4960. conference: end_date: 2017-07-26 location: Honolulu, HA, United States name: 'CVPR: Computer Vision and Pattern Recognition' start_date: 2017-07-21 date_created: 2018-12-11T11:49:11Z date_published: 2017-07-01T00:00:00Z date_updated: 2023-09-26T15:41:11Z day: '01' ddc: - '000' department: - _id: VlKo doi: 10.1109/CVPR.2017.526 ec_funded: 1 external_id: isi: - '000418371405005' file: - access_level: open_access checksum: 72fd291046bd8e5717961bd68f6b6f03 content_type: application/pdf creator: dernst date_created: 2019-01-18T12:45:55Z date_updated: 2020-07-14T12:48:15Z file_id: '5847' file_name: 2017_CVPR_Swoboda.pdf file_size: 898652 relation: main_file file_date_updated: 2020-07-14T12:48:15Z has_accepted_license: '1' intvolume: ' 2017' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Submitted Version page: 4950-4960 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication_identifier: isbn: - 978-153860457-1 publication_status: published publisher: IEEE publist_id: '6524' quality_controlled: '1' scopus_import: '1' status: public title: A dual ascent framework for Lagrangean decomposition of combinatorial problems type: conference user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1 volume: 2017 year: '2017' ... --- _id: '274' abstract: - lang: eng text: We consider the problem of estimating the partition function Z(β)=∑xexp(−β(H(x)) of a Gibbs distribution with a Hamilton H(⋅), or more precisely the logarithm of the ratio q=lnZ(0)/Z(β). It has been recently shown how to approximate q with high probability assuming the existence of an oracle that produces samples from the Gibbs distribution for a given parameter value in [0,β]. The current best known approach due to Huber [9] uses O(qlnn⋅[lnq+lnlnn+ε−2]) oracle calls on average where ε is the desired accuracy of approximation and H(⋅) is assumed to lie in {0}∪[1,n]. We improve the complexity to O(qlnn⋅ε−2) oracle calls. We also show that the same complexity can be achieved if exact oracles are replaced with approximate sampling oracles that are within O(ε2qlnn) variation distance from exact oracles. Finally, we prove a lower bound of Ω(q⋅ε−2) oracle calls under a natural model of computation. article_processing_charge: No author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov citation: ama: 'Kolmogorov V. A faster approximation algorithm for the Gibbs partition function. In: Proceedings of the 31st Conference On Learning Theory. Vol 75. ML Research Press; 2017:228-249.' apa: Kolmogorov, V. (2017). A faster approximation algorithm for the Gibbs partition function. In Proceedings of the 31st Conference On Learning Theory (Vol. 75, pp. 228–249). ML Research Press. chicago: Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” In Proceedings of the 31st Conference On Learning Theory, 75:228–49. ML Research Press, 2017. ieee: V. Kolmogorov, “A faster approximation algorithm for the Gibbs partition function,” in Proceedings of the 31st Conference On Learning Theory, 2017, vol. 75, pp. 228–249. ista: 'Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition function. Proceedings of the 31st Conference On Learning Theory. COLT: Annual Conference on Learning Theory vol. 75, 228–249.' mla: Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” Proceedings of the 31st Conference On Learning Theory, vol. 75, ML Research Press, 2017, pp. 228–49. short: V. Kolmogorov, in:, Proceedings of the 31st Conference On Learning Theory, ML Research Press, 2017, pp. 228–249. conference: end_date: 2018-07-09 name: 'COLT: Annual Conference on Learning Theory ' start_date: 2018-07-06 date_created: 2018-12-11T11:45:33Z date_published: 2017-12-27T00:00:00Z date_updated: 2023-10-17T12:32:13Z day: '27' ddc: - '510' department: - _id: VlKo ec_funded: 1 external_id: arxiv: - '1608.04223' file: - access_level: open_access checksum: 89db06a0e8083524449cb59b56bf4e5b content_type: application/pdf creator: dernst date_created: 2020-05-12T09:23:27Z date_updated: 2020-07-14T12:45:45Z file_id: '7820' file_name: 2018_PMLR_Kolmogorov.pdf file_size: 408974 relation: main_file file_date_updated: 2020-07-14T12:45:45Z has_accepted_license: '1' intvolume: ' 75' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 228-249 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication: Proceedings of the 31st Conference On Learning Theory publication_status: published publisher: ML Research Press publist_id: '7628' quality_controlled: '1' status: public title: A faster approximation algorithm for the Gibbs partition function tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 75 year: '2017' ... --- _id: '5561' abstract: - lang: eng text: 'Graph matching problems as described in "Active Graph Matching for Automatic Joint Segmentation and Annotation of C. Elegans." by Kainmueller, Dagmar and Jug, Florian and Rother, Carsten and Myers, Gene, MICCAI 2014. Problems are in OpenGM2 hdf5 format (see http://hciweb2.iwr.uni-heidelberg.de/opengm/) and a custom text format used by the feature matching solver described in "Feature Correspondence via Graph Matching: Models and Global Optimization." by Lorenzo Torresani, Vladimir Kolmogorov and Carsten Rother, ECCV 2008, code at http://pub.ist.ac.at/~vnk/software/GraphMatching-v1.02.src.zip. ' acknowledgement: We thank Vladimir Kolmogorov and Stephan Saalfeld forinspiring discussions. article_processing_charge: No author: - first_name: Dagmar full_name: Kainmueller, Dagmar last_name: Kainmueller - first_name: Florian full_name: Jug, Florian last_name: Jug - first_name: Carsten full_name: Rother, Carsten last_name: Rother - first_name: Gene full_name: Meyers, Gene last_name: Meyers citation: ama: Kainmueller D, Jug F, Rother C, Meyers G. Graph matching problems for annotating C. Elegans. 2017. doi:10.15479/AT:ISTA:57 apa: Kainmueller, D., Jug, F., Rother, C., & Meyers, G. (2017). Graph matching problems for annotating C. Elegans. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:57 chicago: Kainmueller, Dagmar, Florian Jug, Carsten Rother, and Gene Meyers. “Graph Matching Problems for Annotating C. Elegans.” Institute of Science and Technology Austria, 2017. https://doi.org/10.15479/AT:ISTA:57. ieee: D. Kainmueller, F. Jug, C. Rother, and G. Meyers, “Graph matching problems for annotating C. Elegans.” Institute of Science and Technology Austria, 2017. ista: Kainmueller D, Jug F, Rother C, Meyers G. 2017. Graph matching problems for annotating C. Elegans, Institute of Science and Technology Austria, 10.15479/AT:ISTA:57. mla: Kainmueller, Dagmar, et al. Graph Matching Problems for Annotating C. Elegans. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:57. short: D. Kainmueller, F. Jug, C. Rother, G. Meyers, (2017). datarep_id: '57' date_created: 2018-12-12T12:31:32Z date_published: 2017-02-13T00:00:00Z date_updated: 2024-02-21T13:46:31Z day: '13' ddc: - '000' department: - _id: VlKo doi: 10.15479/AT:ISTA:57 file: - access_level: open_access checksum: 3dc3e1306a66028a34181ebef2923139 content_type: application/zip creator: system date_created: 2018-12-12T13:02:54Z date_updated: 2020-07-14T12:47:03Z file_id: '5614' file_name: IST-2017-57-v1+1_wormMatchingProblems.zip file_size: 327042819 relation: main_file file_date_updated: 2020-07-14T12:47:03Z has_accepted_license: '1' keyword: - graph matching - feature matching - QAP - MAP-inference license: https://creativecommons.org/publicdomain/zero/1.0/ month: '02' oa: 1 oa_version: Published Version publisher: Institute of Science and Technology Austria status: public title: Graph matching problems for annotating C. Elegans tmp: image: /images/cc_0.png legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode name: Creative Commons Public Domain Dedication (CC0 1.0) short: CC0 (1.0) type: research_data user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2017' ... --- _id: '1231' abstract: - lang: eng text: 'We study the time-and memory-complexities of the problem of computing labels of (multiple) randomly selected challenge-nodes in a directed acyclic graph. The w-bit label of a node is the hash of the labels of its parents, and the hash function is modeled as a random oracle. Specific instances of this problem underlie both proofs of space [Dziembowski et al. CRYPTO’15] as well as popular memory-hard functions like scrypt. As our main tool, we introduce the new notion of a probabilistic parallel entangled pebbling game, a new type of combinatorial pebbling game on a graph, which is closely related to the labeling game on the same graph. As a first application of our framework, we prove that for scrypt, when the underlying hash function is invoked n times, the cumulative memory complexity (CMC) (a notion recently introduced by Alwen and Serbinenko (STOC’15) to capture amortized memory-hardness for parallel adversaries) is at least Ω(w · (n/ log(n))2). This bound holds for adversaries that can store many natural functions of the labels (e.g., linear combinations), but still not arbitrary functions thereof. We then introduce and study a combinatorial quantity, and show how a sufficiently small upper bound on it (which we conjecture) extends our CMC bound for scrypt to hold against arbitrary adversaries. We also show that such an upper bound solves the main open problem for proofs-of-space protocols: namely, establishing that the time complexity of computing the label of a random node in a graph on n nodes (given an initial kw-bit state) reduces tightly to the time complexity for black pebbling on the same graph (given an initial k-node pebbling).' acknowledgement: "Joël Alwen, Chethan Kamath, and Krzysztof Pietrzak’s research is partially supported by an ERC starting grant (259668-PSPC). Vladimir Kolmogorov is partially supported by an ERC consolidator grant (616160-DOICV). Binyi Chen was partially supported by NSF grants CNS-1423566 and CNS-1514526, and a gift from the Gareatis Foundation. Stefano Tessaro was partially supported by NSF grants CNS-1423566, CNS-1528178, a Hellman Fellowship, and the Glen and Susanne Culler Chair.\r\n\r\nThis work was done in part while the authors were visiting the Simons Institute for the Theory of Computing, supported by the Simons Foundation and by the DIMACS/Simons Collaboration in Cryptography through NSF grant CNS-1523467." alternative_title: - LNCS author: - first_name: Joel F full_name: Alwen, Joel F id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87 last_name: Alwen - first_name: Binyi full_name: Chen, Binyi last_name: Chen - first_name: Chethan full_name: Kamath Hosdurg, Chethan id: 4BD3F30E-F248-11E8-B48F-1D18A9856A87 last_name: Kamath Hosdurg - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Krzysztof Z full_name: Pietrzak, Krzysztof Z id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87 last_name: Pietrzak orcid: 0000-0002-9139-1654 - first_name: Stefano full_name: Tessaro, Stefano last_name: Tessaro citation: ama: 'Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:10.1007/978-3-662-49896-5_13' apa: 'Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., & Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-662-49896-5_13' chicago: Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,” 9666:358–87. Springer, 2016. https://doi.org/10.1007/978-3-662-49896-5_13. ieee: 'J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.' ista: 'Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666, 358–387.' mla: Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13. short: J.F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K.Z. Pietrzak, S. Tessaro, in:, Springer, 2016, pp. 358–387. conference: end_date: 2016-05-12 location: Vienna, Austria name: 'EUROCRYPT: Theory and Applications of Cryptographic Techniques' start_date: 2016-05-08 date_created: 2018-12-11T11:50:51Z date_published: 2016-04-28T00:00:00Z date_updated: 2021-01-12T06:49:15Z day: '28' department: - _id: KrPi - _id: VlKo doi: 10.1007/978-3-662-49896-5_13 ec_funded: 1 intvolume: ' 9666' language: - iso: eng main_file_link: - open_access: '1' url: https://eprint.iacr.org/2016/100 month: '04' oa: 1 oa_version: Submitted Version page: 358 - 387 project: - _id: 258C570E-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '259668' name: Provable Security for Physical Cryptography - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication_status: published publisher: Springer publist_id: '6103' quality_controlled: '1' scopus_import: 1 status: public title: On the complexity of scrypt and proofs of space in the parallel random oracle model type: conference user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 9666 year: '2016' ... --- _id: '1353' abstract: - lang: eng text: We characterize absorption in finite idempotent algebras by means of Jónsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the tables of its basic operations. acknowledgement: 'Libor Barto and Alexandr Kazda were supported by the the Grant Agency of the Czech Republic, grant GACR 13-01832S. ' author: - first_name: Libor full_name: Barto, Libor last_name: Barto - first_name: Alexandr full_name: Kazda, Alexandr id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87 last_name: Kazda citation: ama: Barto L, Kazda A. Deciding absorption. International Journal of Algebra and Computation. 2016;26(5):1033-1060. doi:10.1142/S0218196716500430 apa: Barto, L., & Kazda, A. (2016). Deciding absorption. International Journal of Algebra and Computation. World Scientific Publishing. https://doi.org/10.1142/S0218196716500430 chicago: Barto, Libor, and Alexandr Kazda. “Deciding Absorption.” International Journal of Algebra and Computation. World Scientific Publishing, 2016. https://doi.org/10.1142/S0218196716500430. ieee: L. Barto and A. Kazda, “Deciding absorption,” International Journal of Algebra and Computation, vol. 26, no. 5. World Scientific Publishing, pp. 1033–1060, 2016. ista: Barto L, Kazda A. 2016. Deciding absorption. International Journal of Algebra and Computation. 26(5), 1033–1060. mla: Barto, Libor, and Alexandr Kazda. “Deciding Absorption.” International Journal of Algebra and Computation, vol. 26, no. 5, World Scientific Publishing, 2016, pp. 1033–60, doi:10.1142/S0218196716500430. short: L. Barto, A. Kazda, International Journal of Algebra and Computation 26 (2016) 1033–1060. date_created: 2018-12-11T11:51:32Z date_published: 2016-07-20T00:00:00Z date_updated: 2021-01-12T06:50:06Z day: '20' department: - _id: VlKo doi: 10.1142/S0218196716500430 intvolume: ' 26' issue: '5' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1512.07009 month: '07' oa: 1 oa_version: Preprint page: 1033 - 1060 publication: International Journal of Algebra and Computation publication_status: published publisher: World Scientific Publishing publist_id: '5893' quality_controlled: '1' scopus_import: 1 status: public title: Deciding absorption type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 26 year: '2016' ... --- _id: '1377' abstract: - lang: eng text: We consider the problem of minimizing the continuous valued total variation subject to different unary terms on trees and propose fast direct algorithms based on dynamic programming to solve these problems. We treat both the convex and the nonconvex case and derive worst-case complexities that are equal to or better than existing methods. We show applications to total variation based two dimensional image processing and computer vision problems based on a Lagrangian decomposition approach. The resulting algorithms are very effcient, offer a high degree of parallelism, and come along with memory requirements which are only in the order of the number of image pixels. author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov - first_name: Thomas full_name: Pock, Thomas last_name: Pock - first_name: Michal full_name: Rolinek, Michal id: 3CB3BC06-F248-11E8-B48F-1D18A9856A87 last_name: Rolinek citation: ama: Kolmogorov V, Pock T, Rolinek M. Total variation on a tree. SIAM Journal on Imaging Sciences. 2016;9(2):605-636. doi:10.1137/15M1010257 apa: Kolmogorov, V., Pock, T., & Rolinek, M. (2016). Total variation on a tree. SIAM Journal on Imaging Sciences. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/15M1010257 chicago: Kolmogorov, Vladimir, Thomas Pock, and Michal Rolinek. “Total Variation on a Tree.” SIAM Journal on Imaging Sciences. Society for Industrial and Applied Mathematics , 2016. https://doi.org/10.1137/15M1010257. ieee: V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM Journal on Imaging Sciences, vol. 9, no. 2. Society for Industrial and Applied Mathematics , pp. 605–636, 2016. ista: Kolmogorov V, Pock T, Rolinek M. 2016. Total variation on a tree. SIAM Journal on Imaging Sciences. 9(2), 605–636. mla: Kolmogorov, Vladimir, et al. “Total Variation on a Tree.” SIAM Journal on Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics , 2016, pp. 605–36, doi:10.1137/15M1010257. short: V. Kolmogorov, T. Pock, M. Rolinek, SIAM Journal on Imaging Sciences 9 (2016) 605–636. date_created: 2018-12-11T11:51:40Z date_published: 2016-05-03T00:00:00Z date_updated: 2021-01-12T06:50:15Z day: '03' department: - _id: VlKo doi: 10.1137/15M1010257 ec_funded: 1 intvolume: ' 9' issue: '2' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1502.07770 month: '05' oa: 1 oa_version: Preprint page: 605 - 636 project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication: SIAM Journal on Imaging Sciences publication_status: published publisher: 'Society for Industrial and Applied Mathematics ' publist_id: '5834' quality_controlled: '1' scopus_import: 1 status: public title: Total variation on a tree type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 9 year: '2016' ... --- _id: '1612' abstract: - lang: eng text: We prove that whenever A is a 3-conservative relational structure with only binary and unary relations,then the algebra of polymorphisms of A either has no Taylor operation (i.e.,CSP(A)is NP-complete),or it generates an SD(∧) variety (i.e.,CSP(A)has bounded width). author: - first_name: Alexandr full_name: Kazda, Alexandr id: 3B32BAA8-F248-11E8-B48F-1D18A9856A87 last_name: Kazda citation: ama: Kazda A. CSP for binary conservative relational structures. Algebra Universalis. 2016;75(1):75-84. doi:10.1007/s00012-015-0358-8 apa: Kazda, A. (2016). CSP for binary conservative relational structures. Algebra Universalis. Springer. https://doi.org/10.1007/s00012-015-0358-8 chicago: Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” Algebra Universalis. Springer, 2016. https://doi.org/10.1007/s00012-015-0358-8. ieee: A. Kazda, “CSP for binary conservative relational structures,” Algebra Universalis, vol. 75, no. 1. Springer, pp. 75–84, 2016. ista: Kazda A. 2016. CSP for binary conservative relational structures. Algebra Universalis. 75(1), 75–84. mla: Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” Algebra Universalis, vol. 75, no. 1, Springer, 2016, pp. 75–84, doi:10.1007/s00012-015-0358-8. short: A. Kazda, Algebra Universalis 75 (2016) 75–84. date_created: 2018-12-11T11:53:01Z date_published: 2016-02-01T00:00:00Z date_updated: 2021-01-12T06:52:00Z day: '01' department: - _id: VlKo doi: 10.1007/s00012-015-0358-8 intvolume: ' 75' issue: '1' language: - iso: eng main_file_link: - open_access: '1' url: http://arxiv.org/abs/1112.1099 month: '02' oa: 1 oa_version: Preprint page: 75 - 84 publication: Algebra Universalis publication_status: published publisher: Springer publist_id: '5554' quality_controlled: '1' scopus_import: 1 status: public title: CSP for binary conservative relational structures type: journal_article user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87 volume: 75 year: '2016' ... --- _id: '1193' abstract: - lang: eng text: We consider the recent formulation of the Algorithmic Lovász Local Lemma [1], [2] for finding objects that avoid "bad features", or "flaws". It extends the Moser-Tardos resampling algorithm [3] to more general discrete spaces. At each step the method picks a flaw present in the current state and "resamples" it using a "resampling oracle" provided by the user. However, it is less flexible than the Moser-Tardos method since [1], [2] require a specific flaw selection rule, whereas [3] allows an arbitrary rule (and thus can potentially be implemented more efficiently). We formulate a new "commutativity" condition, and prove that it is sufficient for an arbitrary rule to work. It also enables an efficient parallelization under an additional assumption. We then show that existing resampling oracles for perfect matchings and permutations do satisfy this condition. Finally, we generalize the precondition in [2] (in the case of symmetric potential causality graphs). This unifies special cases that previously were treated separately. acknowledgement: European Unions Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no 616160 article_number: '7782993' article_processing_charge: No author: - first_name: Vladimir full_name: Kolmogorov, Vladimir id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87 last_name: Kolmogorov citation: ama: 'Kolmogorov V. Commutativity in the algorithmic Lovasz local lemma. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science. Vol 2016-December. IEEE; 2016. doi:10.1109/FOCS.2016.88' apa: 'Kolmogorov, V. (2016). Commutativity in the algorithmic Lovasz local lemma. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science (Vol. 2016–December). New Brunswick, NJ, USA : IEEE. https://doi.org/10.1109/FOCS.2016.88' chicago: Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, Vol. 2016–December. IEEE, 2016. https://doi.org/10.1109/FOCS.2016.88. ieee: V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, NJ, USA , 2016, vol. 2016–December. ista: 'Kolmogorov V. 2016. Commutativity in the algorithmic Lovasz local lemma. Proceedings - Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2016–December, 7782993.' mla: Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” Proceedings - Annual IEEE Symposium on Foundations of Computer Science, vol. 2016–December, 7782993, IEEE, 2016, doi:10.1109/FOCS.2016.88. short: V. Kolmogorov, in:, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, IEEE, 2016. conference: end_date: 2016-09-11 location: 'New Brunswick, NJ, USA ' name: 'FOCS: Foundations of Computer Science' start_date: 2016-09-09 date_created: 2018-12-11T11:50:38Z date_published: 2016-12-15T00:00:00Z date_updated: 2023-09-19T14:24:57Z day: '15' department: - _id: VlKo doi: 10.1109/FOCS.2016.88 ec_funded: 1 external_id: arxiv: - '1506.08547' language: - iso: eng main_file_link: - open_access: '1' url: https://arxiv.org/abs/1506.08547v7 month: '12' oa: 1 oa_version: Preprint project: - _id: 25FBA906-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '616160' name: 'Discrete Optimization in Computer Vision: Theory and Practice' publication: Proceedings - Annual IEEE Symposium on Foundations of Computer Science publication_status: published publisher: IEEE publist_id: '6158' quality_controlled: '1' related_material: record: - id: '5975' relation: later_version status: public scopus_import: 1 status: public title: Commutativity in the algorithmic Lovasz local lemma type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 2016-December year: '2016' ...