Viewing profile — c0deb0t
c0deb0t
HN member- Joined
- Tue, Oct 01, 2019, 6:52 PM UTC
- HN karma
- 100
- Public activity
- 46 items
- HN profile
- View on Hacker News ↗
About c0deb0t
No profile information was provided.
Recent public activity
-
comment
Comment #40447933
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 …
- story
-
comment
Comment #28092544
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 ori…
-
comment
Comment #26572009
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 a…
- story
-
comment
Comment #26560844
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 a…
- story
- story
- story
-
comment
Comment #25055040
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 childre…
- story
-
comment
Comment #22937857
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 …
- story
-
comment
Comment #22800616
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 diagon…
-
comment
Comment #22795325
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 eac…
-
comment
Comment #22791516
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.
-
comment
Comment #22790646
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 sho…
- story
-
comment
Comment #22101328
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…
- story
-
comment
Comment #22093369
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…
- story
-
comment
Comment #22069447
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…
- story
-
comment
Comment #22061630
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 a…