Results 111 to 120 of about 966 (158)

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.
Ablayev F., Ablayev M.
openaire   +3 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 ...
J. Kaps, K. Yuksel, B. Sunar
openaire   +1 more source

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.
Safavi-Naini, Rei, Tonien, Joseph
openaire   +2 more sources

Quantum Hashing via Classical $��$-universal Hashing Constructions

2014
In the paper, we define the concept of the quantum hash generator and offer design, which allows to build a large amount of different quantum hash functions. The construction is based on composition of classical $ $-universal hash family and a given family of functions -- quantum hash generator.
Ablayev, Farid, Ablayev, Marat
openaire   +1 more source

Universally composable anonymous Hash certification model

Science in China Series F: Information Sciences, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Fan, Ma, Jianfeng, Moon, Sangjae
openaire   +2 more sources

Universal hash functions for an infinite universe and hash trees

Information Processing Letters, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

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.
openaire   +1 more source

Hashing practice: analysis of hashing and universal hashing

ACM SIGMOD Record, 1988
Much of the literature on hashing deals with overflow handling (collision resolution) techniques and its analysis. What does all the analytical results mean in practice and how can they be achieved with practical files? This paper considers the problem of achieving analytical performance of hashing techniques in practice with reference to successful ...
openaire   +1 more source