-
It would be good to refactor the code to extract the parts specific to finalsize from the solver functions. In other words, the solver function should only contain the solver algorithm and nothing mor…
-
Because LDB uses content-addressable storage, it needs a hash for every data object it indexes. In alpha, LDB uses md5. The simplest approach is to have ldb read each data object's contents during ind…
-
I noticed that the current algorithms seem to have behaviour like:
```
idx = self.idx
self.v[idx] += update_here
self.idx = (self.idx + 1) % self.num_states
```
So, the async upda…
-
When I try to use the complex deconvolution (polar, if it matters), the z planes further from the center are brighter than the z planes closer to the center. Do you have a data set that worked for co…
sudgy updated
4 years ago
-
### What are you trying to do?
Calculate only a few first largest eigenvalues(not all).
### What did you do?
Use `gonum.org/v1/gonum/mat/eigen.go`.
### What did you expect to happen?
For exam…
-
BestSplitBigCatIter is too slow. Possibly investigate using fully randomized search earlier or "Stochastic Greedy Algorithms: A leaning based approach to combinatorial optimization" [1] as in rf-ace.
…
-
:red_circle: **Title** :
Add BFS and DFS Algorithm Implementations
:red_circle: **Aim** :
To implement Breadth-First Search (BFS) and Depth-First Search (DFS) algorithms for traversing or sea…
-
Geoffrey's raw notes from the discussion.
## 08/07/24
### Horizon finding chat at SXS Con 2024
#### Harald whiteboard talk
* Nils is worried about horizon finding for GPUs...
* Harald's idea:
$…
-
On Sun, Jan 7, 2024 at 5:46 PM John Jannotti wrote:
I enjoy bignum implementations, so I was looking through nat.go and saw that `mulRange` is implemented in a surprising, recursive way,. In the no…
-
I received the following feedback after my talk at Strange Loop. The feedback is quoted, my answers inline.
> 1. Code that has nothing to do with querying can often be expressed as a query. For ins…