-
## Description:
I want to add Kahn's Algorithm under the graph section as it is one of most important algorithms while studying graph theory
## Checklist:
## Checklist:
- [x] Contributor in GS…
-
零知识证明数学理解
[starks-vs-snarks](https://consensys.net/blog/blockchain-explained/zero-knowledge-proofs-starks-vs-snarks/)
[从零开始学习 zk-SNARK](https://secbit.io/blog/2020/01/22/learn-zk-snark-from-zero…
-
Thanks for putting this project together. Is there any way a table or small list could be included to describe which libraries support incremental item additions? I imagine for many this is an importa…
-
Paper: http://math1.math.huji.ac.il/~alexlub/PAPERS/ramanujan%20graphs/ramanujanGraphs.pdf
Lubotzky, Alexander, Ralph Phillips, and Peter Sarnak. "Ramanujan graphs." Combinatorica 8.3 (1988): 261-2…
-
## Description:
I would like to contribute to the AlgoGenesis project by implementing two important shortest path algorithm: Dijkstra’s Algorithm.
## Proposed Changes:
- Dijkstra’s Algorithm: T…
-
I scanned my AWS account into memory and selected a specific VPC, it's subnets, their route tables, their NGWs, and the IGW. I then can generated CF and Terraform and all the other text outputs inclu…
-
I am thinking of a metric for long-form ASR and segmentation. Consider the following scenario:
* The input is a long recording (either single speaker or multi speaker).
* References may be with word…
-
Is there a class for trees in BGL?
-
Within Tribler we aim to calculate and show trust level of our neighbors.
Trust levels evolve over time, as more information is coming in from our blockchain. Restarting the calculation from cratch…
-
Knowledge representations may have a probabilistic nature and capturing that is especially important for complex business domains where data is ... non-stationary or contextual.
This is often seen …