-
When running a simple job with one positive and one negative strain with a large genome size of 36Mbases and nearly nothing being filtered, the subsequent FPPP algorithm runs for a very long time as i…
-
```
What steps will reproduce the problem?
1. Compile the attached test program: javac -g FNTTest.java
2. Run it: java FNTTest
What is the expected output?
Program runs without errors.
What do you s…
-
From my understanding, flex attention (using `block_mask`) gets faster when the number of empty blocks is larger. If the inputs (Q, K, V) do not represent sequences, but graphs with local connectivity…
-
### Title: Add Fast Fourier Transform (FFT) Algorithm
### Description:
The Fast Fourier Transform (FFT) is an efficient algorithm for computing the discrete Fourier transform (DFT) and its inverse…
-
The general question is, does mamba-ssm currently support sequence parallelism in the mixer?
I noticed that Section 8.2 in the paper of Mamba2 proposes a potential way to split activation among mu…
-
**What is your use-case and why do you need this feature?**
I need to serialize objects with many Doubles in them. The JDK's default Double serialization is slow, particularly on Android phones.
…
-
## Feature request
**Is your feature request related to a problem? Please describe.**
It's not very clear from the documentation what sort of string compression algorithms apply to low cardinali…
-
```
What steps will reproduce the problem?
1. Compile the attached test program: javac -g FNTTest.java
2. Run it: java FNTTest
What is the expected output?
Program runs without errors.
What do you s…
-
```
What steps will reproduce the problem?
1. Compile the attached test program: javac -g FNTTest.java
2. Run it: java FNTTest
What is the expected output?
Program runs without errors.
What do you s…
-
```
What steps will reproduce the problem?
1. Compile the attached test program: javac -g FNTTest.java
2. Run it: java FNTTest
What is the expected output?
Program runs without errors.
What do you s…