-
My use case was 100k items with lots of duplicates. I compared my own Floyd-Rivest implementation, your code, and nth_element. For small lists, nth_element was the fastest, with Floyd-Rivest and quick…
-
Add a standard set of test data (encrypted and unencrypted, with keys) to enable a new implementation to be validated.
-
```
Since it is not that hard to implement a Check Digit Scheme incorrectly it
would be very helpful to
publish a canonic set of "Testvectors" showing the checkdigits as calculated by
several algor…
-
This repo should contain implementations of search procedures over grammar expressions (BFS, DFS, A*, ...)
core functionality:
- depth-first, breadth-first
- make a different file for the expa…
-
```
import org.graphstream.graph.*;
import org.graphstream.graph.implementations.*;
public class Tutorial1 {
public static void main(String args[]) {
Graph graph = new SingleGraph("…
ghost updated
5 years ago
-
You mentioned that linear and nonlinear LSQ are comparable in runtime. Naively, one would expect that the former is much less work and is much faster than the latter. This all hints that there is some…
ev-br updated
9 years ago
-
The parsing strategy described in https://spec.commonmark.org/0.30/#appendix-a-parsing-strategy does not appear to reflect the actual implementations.
Specifically, the section "An algorithm for p…
-
Hi,
I noticed that the built-in `reverse` function gets very slow as soon as the matrix gets bigger (say 10x10 +).
Please excuse that I'm not very deep into the math behind your or other impleme…
-
As part of [WPT PR #42522](https://github.com/web-platform-tests/wpt/pull/42522), I wrote the following test…
```html
1st FAIL IF INCLUDED
2nd FAIL IF INCLUDED
3rd FAIL IF INCLUDED
```
…
-
### Description
Implement the k-means clustering algorithm.
### Details
Technical Specifications: Tensorflow/PyToch/Caffe
- Type of issue: Multiple (Implementations in different frameworks w…