-
# The Evolution of Online Calendars: From Basic Scheduling to Smart Algorithms - Dunebook
Being organized is vital in this current fast-paced world. Keeping track of our time has become so important …
-
### Proposed new feature or change:
There have been many advancements over the past decade in the algorithms for calculating the Moore-Penrose Generalized Inverse. These advanced algorithms have co…
-
From what I understand from the `mrca()` function of a `Tree` object (https://github.com/jeetsukumaran/DendroPy/blob/master/src/dendropy/datamodel/treemodel.py#L3953), the current algorithm performs a…
-
```
let seed = umul32_lo(x_uint, 0x1f1f1f1f) ^ z_uint;
let mt = new MersenneTwister(seed);
let n = mt.random_int();
this._isSlimy = (n % 10 == 0);
```
`MersenneTwister()` is …
-
At RWC this year, we (maybe @gtank or @tarcieri?) talked about a faster approach to finding suitable keypairs. The current scheme performs a large number of independent trials (in parallel on all avai…
-
Would it be possible to get the algorithm run faster. Maybe at the program split the strings smaller during the run. Now it seems to slow down when the amount of data increases (>100000 words).
-
## 🚀 Feature
Could we please consider having a differentiable implementation of:
Fast Sinkhorn I: an O(n) Algorithm for the Wasserstein-1 Metric
Qichen Liao, Jing Chen, Zihao Wang, Bo Bai, Shi Jin,…
-
Shell Sort Algorithm
-------------
### Description:
Shell Sort is an optimization of Insertion Sort, where elements are sorted over increasing intervals (called gaps) rather than adjacent posi…
-
Its not mentioned anywhere about the complexity that this solves in.
Any hint about the fps or so?
-
use faster hash algorithm
e.g. have a look at the rsync algorithm
- rolling checksum
check IF its faster
check:
- generate hash of file
- generate hashes for parts of a file