-
I think the current MRS comparison is optimized for deciding whether or not two MRS are isomorphic as fast as possible (returning False as soon as possible). But this means something like a Matrix reg…
-
Let's take a simplified (ifelse replaced by if) bar.dot from restructure:
```
digraph bar {
E -> F
E -> J
F -> G
F -> I
G -> I
I -> E
E [label="entry"]
F
G
I
…
-
Identical Code Folding (ICF) is a code size optimization. It is currently used by mainly Chromium, but there are also interests within the Rust community to [mitigate some of the code duplication](htt…
-
Efforts in MRIQC to minimize the baseline process size were resulting in meager gains until I found this. Delaying the import of either module allows reducing the baseline drastically.
-
We can add subgraph isomorphism passes that try to match logical connectivity to a physical topology without performing any swap operations. We can also add these passes to specific spots in the stand…
-
After having migrated our codebase from a pure Dagger 2 implementation to a Hilt-enabled one, we noticed a significant impact in build times for unit tests.
After some investigation into the matter…
-
On sage 9.1
```
sage: G = Graph(loops=False, multiedges=False)
sage: G.add_edges([(i, (i+85)%100) for i in range(100)])
sage: G.add_edges([(i, (i+37)%100) for i in range(100)])
sage: G.add_edges([(…
-
Starting this issue for tracking the learning progress of GNN
-
> Another area I started looking into (but haven't deeply explored yet) for both figuring out how to map variable names to sections of code in a 'smart' way, and potentially also for module identifica…
-
Following #12 I suggest to write a README.md for this repo summarizing with histogram plots the ongoing challenges
Just show the results that lead to the statements, you can link to the notebooks f…