Results 141 to 150 of about 1,394 (186)

Machine-Readable Structural Information Is Essential for Natural Products Research. [PDF]

J Nat Prod
Steffen K, Oberlies NH, Rokas A.
europepmc   +1 more source

Collision-free morgan fingerprints: a principled approach to enhance machine learning performance and interpretability in chemistry. [PDF]

J Cheminform
Li J, Qu X, Zhang W, Zhong S.
europepmc   +1 more source

New combinatorial bounds for universal hash functions.

IACR Cryptol. ePrint Arch., 2009
Nguyen, L, Roscoe, A
openaire   +2 more sources

Duration of Initial Viremia Modulates Functional Properties of HIV-specific T Cell Receptors

Walker B, Ogunshola F, Singh N, Butty V, Mishra A, Habte Z, Vecchiarello L, Fahad A, Juergens K, Cheever S, Allombert M, Webber A, Piechocka-Trocha A, Ismail N, Nathan A, Li X, Reddy K, Gounder K, Baiyegunhi O, Ghebremichael M, Gaiha G, Dong K, Dekosky B, Ndung'u T, Birnbaum M.   +24 more
europepmc   +1 more source

Behavioral Time Scale Synaptic Plasticity (BTSP) endows Hyperdimensional Computing with brain-like information retrieval flexibility

Maass W, Yu C, Wu Y, Wang A.
europepmc   +1 more source

Quantum hashing via ∈-universal hashing constructions and classical fingerprinting [PDF]

Lobachevskii Journal of Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farid Ablayev, Marat Ablayev
exaly   +6 more sources

Variationally universal hashing [PDF]

Information Processing Letters, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ted Krovetz, Phillip Rogaway
exaly   +3 more sources

Efficient Unconditionally Secure Signatures Using Universal Hashing [PDF]

Lecture Notes in Computer Science, 2018
Digital signatures are one of the most important cryptographic primitives. In this work we construct an information-theoretically secure signature scheme which, unlike prior schemes, enjoys a number of advantageous properties such as short signature ...
Erika Andersson, Petros Wallden, Aysajan Abidin   +2 more
exaly   +2 more sources

Energy Scalable Universal Hashing

IEEE Transactions on Computers, 2005
Message authentication codes (MACs) are valuable tools for ensuring the integrity of messages. MACs may be built around a universal hash function (NH) which was explored in the construction of UMAC. In this paper, we use a variation on NH called WH. WH reaches optimally in the sense that it is universal with half the hash length of NH and it achieves ...
Jens-Peter Kaps, Kaan Yüksel, Berk Sunar   +2 more
exaly   +2 more sources