Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
We consider dictionaries of size n over the finite universe U ={0, 1}^w and introduce a new technique for their implementation: error correcting codes. The use of such codes makes it possible to replace the use of strong forms of hashing, such as universal hashing, with much weaker forms, such as clustering.<br />We use our approach to construct,
Peter Bro Miltersen
+7 more sources
Classification of Malicious URLs Using Machine Learning. [PDF]
Abad S, Gholamy H, Aslani M.
europepmc +1 more source
2FAST2Q: a general-purpose sequence search and counting program for FASTQ files. [PDF]
Bravo AM, Typas A, Veening JW.
europepmc +1 more source
A survey of mapping algorithms in the long-reads era. [PDF]
Sahlin K+3 more
europepmc +1 more source
ANCHOR-Grid: Authenticating Smart Grid Digital Twins Using Real-World Anchors. [PDF]
Hatami M+5 more
europepmc +1 more source
A Critical Cybersecurity Analysis and Future Research Directions for the Internet of Things: A Comprehensive Review. [PDF]
Tariq U, Ahmed I, Bashir AK, Shaukat K.
europepmc +1 more source
A SURF and SVD-based robust zero-watermarking for medical image integrity. [PDF]
Taj R+4 more
europepmc +1 more source
A federated learning-based privacy-preserving image processing framework for brain tumor detection from CT scans. [PDF]
Al-Saleh A+4 more
europepmc +1 more source
K2R: Tinted de Bruijn graphs implementation for efficient read extraction from sequencing datasets. [PDF]
Vandamme L, Cazaux B, Limasset A.
europepmc +1 more source