-
This task is to implement the multiclass version of the Laplace approximation for GPs. This is based on the soft-max likelihood from #1898 and will be used from the GP multiclass machines from #1900
…
-
Hello, i've been trying to run this as described in the readme, but get the following error:
```
Traceback (most recent call last):
File "runner.py", line 22, in
import treewidth
Modul…
-
Because I like computer science these days, here are some computer science algorithm suggestions:
- Data Structures
- Array
- Linked List
- Hash Table
- Stack
- Queue
- Priority Q…
-
create card for each algorithm track progress in
also note findings, links, ideas from research / reading in each card
and also limitations of the current implementation / alternatives
- [ ] s…
-
This is an awesome project idea originally brought up by @stanyas and @MridulS in #5510.
The idea is to have a visual map of NetworkX functionality, similar to (/inspired by) this excellent graphic…
-
Give a concise summary of Chapter 1 of [Accuracy and Stability of Numerical Algorithms,
Nicholas J. Higham, 2002](http://dx.doi.org/10.1137/1.9780898718027), with a
particular emphasis on R and IEEE-7…
oleks updated
8 years ago
-
### Executive summary
Implement Q SANS resolution as a per q function and store it to NXCanSAS format
### Context and background knowledge
In time-of-flight SANS the resolution curves from al…
-
As noted in one of the code TODOs (`Map::GetBlockedInRadiusTile`), it turns out our bigger circle sizes are indeed different than in the originals. And that they should be ellipses.
0x1208 Dragon (…
-
This follows up on #2508 and is related to #2320 (and the associated PR #2512).
**Is your feature request related to a problem? Please describe.**
When drawing fast with a high latency device, we …
-
**Issue**
JGrapht contains implementations of some heuristic algorithms for the traveling salesman problem (TSP), like nearest-neighbor and nearest-insertion. However, there are many other heuristic …