-
We have several detailed questions since we cannot find the code.
1.For VSS task, Is the global memory the prediction kernel of last convolution? Did you use bipartite matching?
2.For VPS task…
lxtGH updated
2 years ago
-
What:
This would be a new search function which would take an input tree and return the tree(s) that are most similar to the input tree based on some similarity measure.
It would solve the problem o…
-
#1306 laid some of the groundwork for finishing this request, but it's not finished yet, so I'm opening another ticket with the original request.
```
>>> (e) Bundles: Start with a base graph G wit…
-
I successfully ran tracking for the nuscenes dataset. I want to re-identify the tracked objects also by the original Instance_token that exists in nuscenes instead of the numerical tracking_id (Sort o…
-
The paper [DN-DETR](https://arxiv.org/pdf/2203.01305.pdf) presents a novel denoising training method to speed up DETR training, and they said that the bipartite graph matching algorithm we choose is u…
-
## Issue will be closed if:
> 1) You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
> 2) You propose an algorithm that is …
-
Hi, I'm super interested in your work, very well-deserved paper. May I ask how you extract the noun from the caption?
-
There's currently 3 flow implementations that (more or less) do similar things. There's HopcroftKarp, EdmondsKarp, PushRelabel, DFSMatching. There's also a 5th commonly used implementation (that KACTL…
-
# Matroids, briefly · Ben Zhang
Over the summer, I casually got back into competitive programming. I was really surprised to see that Matroid Intersection is now a topic that shows up in contest prob…
-
Looks like something is wrong.
Below output shows as well some deprecation warnings.
```console
=================================== FAILURES ===================================
___________________…