-
I experienced "is_straight_line_drawing()" returning false for valid straight line drawing of a maximal planar graph with 10million vertices first:
https://lists.boost.org/Archives/boost/2024/10/25…
-
We can probably do better than random peer sampling.
We can use the private scheduling theory from my [Calendar Scheduling paper](https://github.com/dbosk/CalendarScheduling) ([CalendarScheduling-p…
dbosk updated
4 years ago
-
Based on the requirements and the existing TxtAI ecosystem, here's a proposed approach to develop LLM Integration for Knowledge Graph Enhancement:
1. Automatic Knowledge Graph Generation and Enrich…
-
I'll post information about performance investigations here.
-
What is the paper attached to this algorithm
-
## 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 am Michael
I am the new student at this tool Diaphora.
I want to realize what algorithm of callgraph you use in this program.
There are two values
callgraph_primes
callgraph_all_prime…
-
Me and @shashi have discussed how we might use a graph-program-format as a kind of parallel IR.
The idea is to have an hourglass design; the DAG is a small core abstraction, above it you build parall…
-
#Peer to peer protocol for communication
### The issue is done when the following features are implemented:
* [ ] _secure_ and _reliable_ communication between peers
* [ ] peer discovery s…
-
Minimal repro:
```
import torch
m = torch.nn.ReflectionPad2d((1, 2, 3, 4))
m_compiled = torch.compile(m)
inp = torch.randn(2, 3, 8, 8, device='cuda', requires_grad=True)
out = m_compiled(inp…