-
What is the technical differences between the models in ./generation/poly_hgraph and /hgraph?
-
This commit introduces the implementation of the Bellman-Ford algorithm, a widely used shortest path algorithm in graph theory. The algorithm efficiently calculates the shortest paths from a source ve…
-
I hope this message finds you well. I am currently exploring smoothxg algorithm. I came across a statement in the paper that raised some questions for me:
"A key issue is that pairwise alignments d…
-
The L1 data cache on MI300 is divided into 4 sets of up to 64 entries, with the cache line of 128B. To utilize the full bandwidth, the kernel has to engage all four sets. However, with large matrix op…
kuhar updated
3 weeks ago
-
Right now, each node of the Reeb Graph generated by `bdc.py`'s `line sweep` (`R` called on [line 175 of bdc.py](https://github.com/uci-uav-forge/pathplanner/blob/e8669b696b741c0994305bdae5fd8860a0146d…
-
# Environment
- **Python version**: 3.8.0
- **Operating system**: Ubuntu 18.04
Requirements from https://zenodo.org/record/5780204#.ZAdittLMKAk version 2
```
qiskit == 0.23.5
pytket == 0.11.…
-
Hi, I intend to use `tract` for inference with `AWS Lambda`. I've observed that the initialization and optimization of ONNX models (from &[u8]) can be 2-3 times slower than the actual model execution.…
-
Starting a new topic since there is a concrete example:
You'll need to install coffea from this branch: `https://github.com/CoffeaTeam/coffea/tree/awkward2_dev` (pip install -e '.[dev]')
You'll ne…
-
Hi
I have many complains about the interface actually that I'm not gonna trow on you as I know it will be overwhelming, but I have one proposal which I feel would not be hard to implement and will …
-
**Describe the solution you'd like**
Ability to change the intensity of glow between objects, as the current system of glow makes tags nigh unreadable. Background color being configurable would also …