HyperX is the first end-to-end FPGA accelerator for Nyström-based HDC graph classification, delivering 6.85× speedup and 169× energy efficiency over CPU baselines plus 3.4% average accuracy gain on TUDataset benchmarks.
Fast and scalable minimal perfect hashing for massive key sets
2 Pith papers cite this work. Polarity classification is still indexing.
abstract
Minimal perfect hash functions provide space-efficient and collision-free hashing on static sets. Existing algorithms and implementations that build such functions have practical limitations on the number of input elements they can process, due to high construction time, RAM or external memory usage. We revisit a simple algorithm and show that it is highly competitive with the state of the art, especially in terms of construction time and memory usage. We provide a parallel C++ implementation called BBhash. It is capable of creating a minimal perfect hash function of $10^{10}$ elements in less than 7 minutes using 8 threads and 5 GB of memory, and the resulting function uses 3.7 bits/element. To the best of our knowledge, this is also the first implementation that has been successfully tested on an input of cardinality $10^{12}$. Source code: https://github.com/rizkg/BBHash
representative citing papers
The anti-lexicographic SUS-anchor achieves sampling densities less than 1% above the lower bound for alphabet size 4 and k=1, substantially outperforming bidirectional anchors.
citing papers explorer
-
Efficient and Accurate Graph Classification with Hyperdimensional Computing on FPGA
HyperX is the first end-to-end FPGA accelerator for Nyström-based HDC graph classification, delivering 6.85× speedup and 169× energy efficiency over CPU baselines plus 3.4% average accuracy gain on TUDataset benchmarks.
-
The anti-lexicographic SUS-anchor: a near-optimal k=1 sampling scheme
The anti-lexicographic SUS-anchor achieves sampling densities less than 1% above the lower bound for alphabet size 4 and k=1, substantially outperforming bidirectional anchors.