-
Make a research on existing benchmarks for graph structure learning and automate the use of it.
For example, [this article](https://arxiv.org/abs/2310.05163v1) ([github](https://github.com/GSL-Benchm…
-
### Idea Contribution
- [X] I have read all the feature request issues.
- [X] I'm interested in working on this issue
- [X] I'm part of GSSOC organization
### Explain feature request
There is no Da…
-
On a tangent: elementry geometry diagrams, have straight lines and vertices. It's a graph (discrete).
In the same way, objects in images, if given a minimum possible length (think artificial Planck l…
-
## Tree-based approach
- [Optimised kd-trees for fast image descriptor matching](https://users.cecs.anu.edu.au/~hartley/Papers/PDF/SilpaAnan:CVPR08.pdf)
- [Data structures and algorithms for neare…
-
Hi:
Following up on [the issue about web-dev topics](https://github.com/GSG-G4/post-programme/issues/13), I'm going to list some topics that would be great to consider for learning more about CS.
…
-
## Description
We need to implement an algorithm for generating computation graphs. This algorithm should efficiently create and manage computation graphs, which are essential for various computati…
-
### Description
With #1523, it's easy to train models similar to UGraphEmb. The UGraphEmb model structure is interesting, using attention and multiple layers.
1. Bai Y, Ding H, Qiao Y, et al. Un…
huonw updated
4 years ago
-
### Checks
- [X] This is not a duplicate of an existing issue (please have a look through our [open issues list](https://github.com/TheOdinProject/curriculum/issues) to make sure)
- [X] I have thorou…
-
Hey,
Thanks for the implementation, but what is the maximum instance size (no. of nodes) for which this implementation is capable of delivering solutions within a short time (lets say a few seconds…
-
gemini : Sure, here are some notes for February 24, 2024:
The Unit Sphere as a Fundamental Abstraction
Imagine a sphere of one unit size or a line segment of size one that can be subdivided into par…