c0deb0t

28 ms·

1.
by c0deb0t 2y ago
PTHash and other minimum perfect hash functions return an arbitrary value if the query key did not exist when building the MPHF, so they can be a lot smaller. B-field can identify query keys that don't exist in the set (with high proba
2.
A simple bounded-context suffix array construction algorithm(github.com)
1 points by c0deb0t 3y ago|0 comments
3.
by c0deb0t 5y ago
Adversarial attacks is a super interesting field, but unfortunately I feel that a lot of papers are just incremental attack or defense improvements like a cat-and-mouse game. I originally did some research on 3D point cloud attacks, but lat
4.
by c0deb0t 5y ago
Yes, this will uwuify your text at high speeds. It reached 2.3 GB/s on my 8-core macbook pro, while uwu-ing the first 1 GB of english Wikipedia. This Rust command-line tool takes advantage of SSE4.1 SIMD vectorization and multithreadin
5.
Uwuify – fastest text uwuifier in the west: a Rust tool for uwu-ing text(github.com)
5 points by c0deb0t 5y ago|1 comments
6.
by c0deb0t 5y ago
Yes, this will uwuify your text at high speeds. It reached 2.3 GB/s on my 8-core macbook pro, while uwu-ing the first 1 GB of english Wikipedia. This Rust command-line tool takes advantage of SSE4.1 SIMD vectorization and multithreadin
7.
Show HN: Uwuify – fastest text uwuifier in the west(github.com)
7 points by c0deb0t 5y ago|1 comments
8.
Out of 300 AI models, none are of potential clinical use due to flaws or biases(twitter.com)
3 points by c0deb0t 5y ago|0 comments
9.
Benchmarking different programming languages for a simple bioinformatics task(github.com)
2 points by c0deb0t 5y ago|1 comments
10.
by c0deb0t 6y ago
For binary trees, indexing can be done by saving the subtree size of each node and doing a sort of binary search. Not sure if this is fast for B-trees that have more than 2 children nodes, though.
11.
Show HN: Cute tricks for SIMD vectorized binary encoding of nucleotides in Rust(github.com)
5 points by c0deb0t 6y ago|0 comments
12.
by c0deb0t 6y ago
I'm a high school student that is quite new to Rust, and I am liking it so far. I learned a lot from this project and I hope that it can be a good learning resource for others. In addition to this, I am also working on a SIMD edit dist
13.
Show HN: 9S – Basic multithreaded ping program in Rust(github.com)
2 points by c0deb0t 6y ago|1 comments
14.
by c0deb0t 6y ago
Since I am storing the entire DP matrix as diagonal vectors that are flattened, I don't think there will be many cache misses. Each diagonal only depends on its previous two diagonals, and each diagonal is stored contiguously in memory
15.
by c0deb0t 6y ago
I took a look at the code, and read the paper. It seems that they directly calculate the entire 2D DP array, but use SIMD to allow each cell to contain multiple values, one for each query string. My approach uses anti-diagonals instead, but
16.
by c0deb0t 6y ago
Though I probably won't implement the different weighting schemes, I currently have alignment traceback and searching (allow "free shifts" for the pattern string) features.
17.
by c0deb0t 6y ago
High school is out so I am learning SIMD instruction sets, like AVX2 and SSE, and using these to speed up Hamming/Levenshtein distance calculations in Rust. Preliminary testing shows a 20x speedup using vectorized SIMD operations! The
18.
So you want to do some scientific research as a high school student?(blog.liudaniel.com)
2 points by c0deb0t 7y ago|0 comments
19.
by c0deb0t 7y ago
I am a high school student, and this is a published paper that I wrote. If you want to read a shorter blog version of my work, please take a look at my blog: https://blog.liudaniel.com/n-grams-BK-trees . I enjoy working on b
20.
Show HN: My Published HS Research – Deduplicating Unique Molecular Identifiers(peerj.com)
1 points by c0deb0t 7y ago|1 comments
21.
by c0deb0t 7y ago
I am a high school student, and this is a published paper that I wrote. If you want to read a shorter blog version of my work, please take a look at my blog: https://blog.liudaniel.com/n-grams-BK-trees . I enjoy working on b
22.
Show HN: My 11th grade research project – faster DNA sequence duplicate removal(peerj.com)
2 points by c0deb0t 7y ago|1 comments
23.
by c0deb0t 7y ago
I am a high school student, and this is a published paper that I wrote. If you want to read a shorter blog version of my work, please take a look at my blog: https://blog.liudaniel.com/n-grams-BK-trees . I enjoy working on b
24.
Show HN: I'm in high school and I did research on removing similar DNA sequences(peerj.com)
1 points by c0deb0t 7y ago|1 comments
25.
by c0deb0t 7y ago
I implemented many deep learning algorithms in this library, mainly as a way to learn about deep learning. Beware, it is very slow since it is written in Java and there is no GPU acceleration. Maybe this will be of use to people who are lea
26.
Show HN: My Java deep learning library from 10th grade(github.com)
1 points by c0deb0t 7y ago|1 comments
27.
by c0deb0t 7y ago
I am a high school student, and this is a published paper that I wrote. If you want to read a shorter blog version of my work, go here: https://blog.liudaniel.com/n-grams-BK-trees . The general problem is grouping similar DN
28.
Show HN: My 11th grade research project: faster DNA sequence duplicate removal(peerj.com)
2 points by c0deb0t 7y ago|1 comments
29.
by c0deb0t 7y ago
I am a high school student and this blog post is a summary of a research project I did. The full published paper can be viewed here: https://peerj.com/articles/8275/ . This is not really explained in the blog post,
30.
Efficiently grouping similar DNA sequences to remove duplicates (2019)(blog.liudaniel.com)
1 points by c0deb0t 7y ago|1 comments

More ›