Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Mondal, Bratin"'
We study the geometric knapsack problem in which we are given a set of $d$-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given $d$-dimensional (unit hy
Externí odkaz:
http://arxiv.org/abs/2404.03981
Autor:
N, Viswesh, Jadhav, Kaushal, Amalanshu, Avi, Mondal, Bratin, Waran, Sabaris, Sadhwani, Om, Kumar, Apoorv, Chakravarty, Debashish
The following work is a reproducibility report for CLRNet: Cross Layer Refinement Network for Lane Detection. The basic code was made available by the author. The paper proposes a novel Cross Layer Refinement Network to utilize both high and low leve
Externí odkaz:
http://arxiv.org/abs/2310.01142