"Graph cuts always find a global optimum (with a catch)."

Hunter Lang, David A. Sontag, Aravindan Vijayaraghavan (2020)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2020-11-12

a service of  Schloss Dagstuhl - Leibniz Center for Informatics