-
Similarly to how multiplication uses different algorithms depending on some conditions, GCD could be optimized by using more than 1 algorithm. It should look something like this:
https://github.com/R…
-
HyperLogLog is an algorithm that provides 97% accuracy on cardinality counts (ie, unique visitors), while using a very small memory footprint. We could add support for this algorithm within Piwik to n…
-
A new problem has surfaced after the addition of promotion where faster algorithms do not process a target from start to finish independent of the slower ones.
-
# Feature or enhancement
### Proposal:
I implemented `fnmatch.translate` and `fnmatch.filter` in C in #121446 but the performances for `fnmatch.filter` are less pronounced than those in `fnmatch…
-
- [ ] Gather statistics about the order of item arrays to better choose algorithms.
- [x] Implement an unstable, O(n log n) time, constant space sorting algorithm that work fast on small and medium-si…
-
https://github.com/jOOQ/jOOQ/issues/12023 (implemented in jOOQ 3.15) has added a more PostgreSQL style implementation of:
- `JSONB::toString`
- `JSONB::hashCode`
- `JSONB::equals`
Which effect…
-
I want to ask whether the provided pre-built knn-graphs are accurate (built by brute-force) or approximate (built using fast but approximate algorithm)?
-
# What?
ON AMI ingest we presort the ADOs to ensure Top level/parents get ingested first. But we don't traverse deep enough when sorting (specially when using UUIDs for the semantic relationships) …
-
**Describe the bug**
`get_chain_position` for unconfirmed transactions is very inefficient if we have "nested conflicts". Since unconfirmed transactions that spend from evicted transactions are a…
-
Since a `Component` is immutable, during construction, we should store some "hints" about it and its children that are accessible in `O(1)` time. For example, one of the most common algorithms is to t…