Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 HorKai2021
%A Hornakova*, Andrea
%A Kaiser*, Timo
%A Rolinek, Michal
%A Rosenhahn, Bodo
%A Swoboda, Paul
%A Henschel, Roberto
%A equal contribution), (*
%B International Conference on Computer Vision (ICCV)
%D 2021
%K MOT Scalable leibnizailab myown
%T Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths
%U https://arxiv.org/abs/2108.10606
@inproceedings{HorKai2021,
added-at = {2021-12-09T11:56:01.000+0100},
author = {Hornakova*, Andrea and Kaiser*, Timo and Rolinek, Michal and Rosenhahn, Bodo and Swoboda, Paul and Henschel, Roberto and equal contribution), (*},
biburl = {https://www.bibsonomy.org/bibtex/2e712b7501758fd2be55d017291ba85d8/tntl3s},
booktitle = {International Conference on Computer Vision (ICCV)},
interhash = {3642905b9f4e61a38463fcc02f3fbafe},
intrahash = {e712b7501758fd2be55d017291ba85d8},
keywords = {MOT Scalable leibnizailab myown},
month = oct,
timestamp = {2021-12-09T11:56:01.000+0100},
title = {Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths},
url = {https://arxiv.org/abs/2108.10606},
year = 2021
}