-
The current end matching algorithm assumes that the vertices' coordinates are perfect; that is, every line segment has a vertex that is shared with another line segment assuming no rounding errors occ…
-
Here I want to try to find a complete and correct algorithm to identify the **direct** dependencies of some package element.
**Assumptions:**
* we are within some SPDX data, e.g. the result of par…
-
### Describe the bug
Ref to Algorithm 2 of [EDM](https://arxiv.org/abs/2206.00364), for a given sample $x_t$, noise is introduced to it reaching a higher noise level $\hat{t}$, then we evaluate net…
-
Great to see a library like this. I would love to see the Big-O performance of each fuzzy algorithm displayed so I know what size of data I can it for and maybe some advice about pros and cons.
I'm…
-
With edit access to the SIVA google spreadsheet, our forthcoming `row-validation` function will be able to sanitize existing data, and alllow our matching algorithms to use more data.
See Also: [Crea…
-
I just stumbled across this project: https://github.com/hrenod/libfprint
The approach that this project took to integrate an unsupported fingerprint reader with libfprint is unusual, but afaik doesn'…
-
Good Morning,
in my ssh connection, I need to pass an option
`ssh -o KexAlgorithms=diffie-hellman-group1-sha1 user@0.0.0.0`
for being an old equipment, I think
What is the possibility of this?
-
An extension of the PageRank (PR) algorithm exists referred to as both Personalized PageRank (PPR) and Topic Sensitive PageRank.
The PR algorithm ranks all vertices of a graph, where more “importa…
ghost updated
6 years ago
-
Hi, first and foremost thank you for your great work and allowing to implement SOM algorithm in such convienent way.
I wanted to ask if there is a possibility to obtain a kind of list with the dista…
-
@matkoniecz,
Could you develop drawing systems on the platform:
a. open building footprint correction tool;
b. academic moderation tool - line drawing - it is to put/seperate colours about spec…