Results 171 to 180 of about 1,013,929 (223)

Time trends in newly recorded diagnoses of 19 long term conditions before, during, and after the covid-19 pandemic: population based cohort study in England using OpenSAFELY.

BMJ
Russell MD, Schaffer A, Bechman K, Gibson M, Massey J, Higgins R, MacKenna B, Inglesby P, Bacon S, Mehrkar A, Goldacre B, Alveyn E, Allen V, Yang Z, Patel S, Adas MA, Sandhu G, Price E, Gama RM, Bramham K, Hotopf M, Norton S, Cope AP, Galloway JB.   +23 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

Some of the next articles are maybe not open access.

Related searches:

Quantum hashing via ∈-universal hashing constructions and classical fingerprinting

Lobachevskii Journal of Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farid Ablayev, Marat Ablayev
exaly   +5 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   +3 more sources

FUZZY UNIVERSAL HASHING AND APPROXIMATE AUTHENTICATION

Discrete Mathematics, Algorithms and Applications, 2011
Traditional data authentication systems are sensitive to single bit changes and so are unsuitable for message spaces that are naturally "fuzzy" where "similar" messages are considered "the same" or indistinguishable. In this paper, we study unconditionally secure approximate authentication.
Reihaneh Safavi-Naini, Dongvu Tonien
openaire   +4 more sources

Quantum Hashing via ε-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas

Lecture Notes in Computer Science, 2014
We define the concept of a quantum hash generator and offer a design, which allows one to build a large number of different quantum hash functions. The construction is based on composition of a classical ε-universal hash family and a given family of functions - quantum hash generators.
Farid Ablayev, Marat Ablayev
exaly   +4 more sources

Universal Hashing and Geometric Codes

Designs, Codes and Cryptography, 1997
A universal class of hash functions is, grosso modo, a collection of hash functions such that a random choice of a function in the set yields a low probability that any two distinct inputs will collide. The concept is due to Carter and Wegman, and has numerous applications. (See the introduction to [\textit{D. R.
J. Bierbrauer
openaire   +2 more sources

Universal hashing

Introduction to Coding Theory, 2018
Using universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number of collisions in
Juergen Bierbrauer
openaire   +2 more sources

Efficient Unconditionally Secure Signatures Using Universal Hashing

Lecture Notes in Computer Science, 2018
Ryan Amiri, Aysajan Abidin, Petros Wallden   +2 more
exaly   +2 more sources

Toward a Universal, Transferable, and Robust Adversarial Perturbation Framework Against Deep Hashing-Based Facial Image Retrieval

IEEE Transactions on Circuits and Systems for Video Technology
Deep Hashing (DH) based image retrieval is commonly used in facial recognition systems for its precision and effectiveness. However, this convenience is accompanied by a mounting threat to privacy.
Dengpan Ye, Yiheng He, Long Tang
exaly   +2 more sources