Solving Large Multicut Problems for Connectomics via Domain Decomposition

Cite

Text

Pape et al. "Solving Large Multicut Problems for Connectomics via Domain Decomposition." IEEE/CVF International Conference on Computer Vision Workshops, 2017. doi:10.1109/ICCVW.2017.7

Markdown

[Pape et al. "Solving Large Multicut Problems for Connectomics via Domain Decomposition." IEEE/CVF International Conference on Computer Vision Workshops, 2017.](https://mlanthology.org/iccvw/2017/pape2017iccvw-solving/) doi:10.1109/ICCVW.2017.7

BibTeX

@inproceedings{pape2017iccvw-solving,
  title     = {{Solving Large Multicut Problems for Connectomics via Domain Decomposition}},
  author    = {Pape, Constantin and Beier, Thorsten and Li, Peter and Jain, Viren and Bock, Davi D. and Kreshuk, Anna},
  booktitle = {IEEE/CVF International Conference on Computer Vision Workshops},
  year      = {2017},
  pages     = {1-10},
  doi       = {10.1109/ICCVW.2017.7},
  url       = {https://mlanthology.org/iccvw/2017/pape2017iccvw-solving/}
}