-
I would like to know what algorithm is basically used to create this tool.
Is there any specific publication that I can read and find more about ?
-
Filing this for the record:
[Gleb Beliakov, Fast Computation of Trimmed Means, Journal of Statistical Software, March 2011](http://www.jstatsoft.org/index.php/jss/article/view/v039c02/v39c02.pdf) pre…
-
Hello!
I tried to contact you by e-mail and Reddit, but that didn't seem to reach you, so posting here in hopes that I could get some better insight on your fast search algorithm. Apologies for ask…
-
# Summary
https://arxiv.org/abs/2211.15118 proposes a faster K-means++ algorithm via random projection to a subspace of smaller dimension. Should we consider integrating the algorithm here to Faiss…
-
There are a few easy fixes within the loop if we can find clever ways of where to set the counter to.
-
My use case involves large numbers of rectangles (e.g., 10k) which I want to pack as quickly as possible, even if the packing isn't optimal.
I've taken the advice in the documentation to use one of…
-
This is an invitation to discussion...
So, react is pretty freaking awesome and I used it quite a bit. One thing unfortunately where react is not as strong is in performance, which gave roots to In…
-
# super fast sort algorithm in js
> sort algorithm
1. Promise.race (return the fast one)
2. Async / Await
```js
// chrome & fast sort 快速排序
// firefox & merge sort 归并排序
const superFast…
-
We can kinda fast read files through streams.
But, some of hash algorithms is very slow, so even file in few megabytes handle pretty long.
Need to think about how can we improve performance here.
-