Viewing profile — lunaticd

3. The project started under a Harvard affiliated Github org during the course of PhDs. These same people later joined Google where it continued to be developed and over time adopt…

i did it does a ton of allocations, which is why i made a simple maxheap implementation and then sort the final result

please make it even faster!

it doesn't seem to have better support for things like xor and count_ones. I believe the main use case is comparisons.

julia> @code_typed hamming_distance(Int8(33), Int8(125)) CodeInfo( 1 ─ %1 = Base.xor_int(x1, x2)::Int8 │ %2 = Base.ctpop_int(%1)::Int8 │ %3 = Base.sext_int(Int64, %2)::Int64 │ noth…

exact in this case means that all the vectors are compared against the query vector. Where as other search methods such as HNSW are approximate searches.

author here. I thought there might be a machine instruction for this but wasn't sure, I also didn't know Julia had a count_ones that counted the 1s. Thanks! With this the timings a…

I'm excited to share a project I've been working on called DataGPTd. DataGPTd is a browser-based tool that aims to help make data analysis as simple as asking a question. It allows…