The Hopcroft–Karp algorithm is the most efficient way to find a maximum cardinality matching in a bipartite graph. Think of applicants for jobs, each applicant has skills for a certain sub-set of the ...
turboquant-py implements the TurboQuant and QJL vector quantization algorithms from Google Research (ICLR 2026 / AISTATS 2026). It compresses high-dimensional floating-point vectors to 1-4 bits per ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results