-
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…
-
Hello,
@avsecz and I saw your poster at ICML WCB and we were quite impressed by the work. However, we have a question about this line in the code:
https://github.com/irashavitt/regularization_le…
-
Are you interested in non-musl implementations, especially `f32` functions faster on modern architectures? I am writing math functions in Rust from scratch, based on my own research since 2017:
htt…
-
Hello, I am very interested in your work.
I would like to ask if the testing results in your paper did not transform the raw data into “panel” for cost calculation? And what are the advantages of pan…
-
Great implementations, many thanks.
I'm new to the continuous learning and a little bit confused about its problem setting. I see that you generated different permuted MNIST data for every task (or…
-
Most STFT implementations, including this one, [do not](https://dsp.stackexchange.com/a/72590/50076) compute STFT per [standard formulation](https://en.wikipedia.org/wiki/STFT#/Discrete-time_STFT). So…
-
CHAMP (Compressed Hash-Array Mapped Prefix-tree) is an incremental improvement over HAMT that simplifies the code, decreases the memory footprint, and increases performance.
[Leveling up Clojure’s…
-
Firstly, thank you for this great library!
The I-Specific Identification Distance given by Definition 5 in the [paper](https://doi.org/10.48550/arXiv.2402.08616) inputs G_true, G_guess, and a set o…
-
I received this in email while on vacation.
> Hello Guido. We have never met but we share a common interest in programming languages. I am the director of the programming languages lab at the Unive…
-
When would be a good time to release versions 1.0.0 of *Courses API* and *Simple Course Replication API*?
Judging from the [dev catalogue](https://dev-registry.erasmuswithoutpaper.eu/catalogue-v1.x…