-
https://github.com/smith-chem-wisc/mzLib/blob/b0f82ea7bf47321ad2b81833961bff6d5706fe13/mzLib/MassSpectrometry/MzSpectra/MzSpectrum.cs#L718-L730
The linked method has an error commonly associated wi…
-
Base on @JayFoxRox's feedback about XbSymbolDatabase. The search process is unoptimized because of not using better algorithms to gain faster scan process.
> Searching for XInput for example, shoul…
-
It would be nice to have an example to compare speed of convergence of SAGA/SVRG/SFW on problems attaining the same optimum.
-
```
What steps will reproduce the problem?
1. Select From Arad to Eforie
2. Depth First search with Tree serach
3. Click on Run
What is the expected output? What do you see instead?
> Program shou…
-
During a recent experiment, a very dense dataset was collected, including many lattices per frame. Usually, during XFEL processing the import, find spots, index, refine and integrate steps take rough…
-
https://arxiv.org/abs/1606.02396
- Tejas D. Kulkarni, Ardavan Saeedi, Simanta Gautam, Samuel J. Gershman
- Submitted on 8 Jun 2016
TMats updated
6 years ago
-
Individual (Prisha) Assessment: 9.5/10
Crossover (Natalie) Assessment: 9.5/10
Individual/Pair - 5/5
- Wiki/Jekyll page with design ideas and usage
updated with ideas and how project will be used…
-
I tried to break down the Vending Upgrade in Omnifactory, just to see what is required. But once the number of ingredients is greater than a hundred or slow, the calculator would be very slow. It woul…
-
One of the best known use-cases for graph databases is for Natural Language Processing. For example in one project I am involved in, we store text in ArangoDB nodes, linking it with edges into nodes c…
ixxie updated
8 months ago
-
As part of a school project we have been working on several algorithms that can speed up/improve the current brown graph coloring algorithms. This includes a faster version of Brown's original algorit…