-
**Describe the feature**
Feature description
**Motivation**
A clear and concise description of the motivation of the feature. Ex1. It is inconvenient when [....]. Ex2. There is a recent paper [..…
-
- Update README.md
- Document the code
-
Hi Hang,
Congratulations on your awesome work! I am really impressed!
I would like to know if you could share the code and pretrained models for your "Co-Occurrent Features in Semantic Segmentat…
-
**Describe the feature**
For now, mmengine also save testing log in work_dirs. However, the folder names of traning and testing logs are both in the same pattern. After testing model several times,…
-
Hello,
Recently I have read about an interesting upgrade of Cyclomatic Complexity called Cognitive Complexity.
> Cyclomatic Complexity was initially formulated as a measurement of the “testabili…
-
Here's one implementation: http://linux.thai.net/~thep/datrie/
For liblevenshtein, implement the algorithm described in, "Compression of double array structures for fixed length keywords", by Masao F…
dylon updated
8 years ago
-
**What it is?**
Similar to the open issue https://github.com/karlsen-network/karlsend/issues/27 which will add 12-word support into the `karlsend` node daemon, we must support 24-word mnemonic string…
-
# Description
I do not have a specific project in mind. It would be great if there is a mentor interested in this topic. I would want to work on research on Quantum Reinforcement Learning algorithms …
-
[Skim](https://skimhq.tech) is an alternative to arxiv-sanity with lot of features.
We built this inspired by arxiv-sanity and wanted to engineer a platform which is scalable and can evolve with ti…
-
Background
Currently, 3DuF only has the ability to create channels/connections that are straight or have sharp edges.
Goal
Add the drawing code in paperjs that can generate Paths using either th…