-
I have come to appreciate the feature of having multiple converters create HRG entries, e.g.,
- have a 'regular' HRG entry created for every MRG entry, and
- if an MRG entry has an abbreviation spe…
-
statistics that are based on all pairs of observations have computational shortcuts for median and partition. However, those algorithms are pretty complicated.
One idea as simple compromise: create…
-
This is the most performant Levenshtein implementation for NodeJS of which I know, and I have a though on how to make it faster for many applications.
When testing many string pairs by similarity (…
-
From "An Architecture for Parallel Topic Models" by A. Smola and S. Narayanamurthy
> To store the n(t,w) we use the same memory layout as Mallet. That is, we maintain a list of (topic, count) pairs …
-
- key/value pairs coming from the `attributes` table could be grouped
- e.g., more than one `value` of say "Colors" could be grouped into a single row.
- Figure out if there's a default sorting of a…
-
I have run dpclust with pairs of whole genome samples for each patient, comparing the clones between a primary tumour and a metastatic tumour for each patient. The clustering works for all the patient…
-
**GitHub** https://github.com/jongacnik/kirby-index-field
> Kirby field which displays pages (or files) as a [datalist](https://datatables.net/).
>
> This is useful for navigating large sets of …
-
## **Description:**
The Two Pointers Technique is a powerful algorithmic approach used to efficiently solve a wide range of problems. It involves maintaining two pointers that traverse a data str…
-
Either sort colors to the nearest correct name (`red`, `green`, `bright_blue` etc.) or find a way to label the colors so that there are obvios ways to use them and have readable contrast; for example …
-
- [] clustering adjacency with the dendrogram on the borders
- [] left/right adjacency
- [] axon/dendrite adjacency