Results 141 to 150 of about 5,211,169 (196)
Research on a point cloud registration method based on the combination of hash functions and the grey wolf optimizer. [PDF]
Sci RepZhang C, Xu Q, Sun X, Zhu G.
europepmc +1 more source
DBpHash: a blockchain-based dual-band perceptual hashing framework for copyright protection of purely chromatic background images. [PDF]
Sci RepNainar M +2 more
europepmc +1 more source
Advanced security in fog environments using encryption and adaptive user activity tracking. [PDF]
Sci RepRai HM +5 more
europepmc +1 more source
A PUF-Based Secure and Lightweight Authentication Protocol for Medical IoT Environments. [PDF]
Sensors (Basel)Lim H, Park Y, Park Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of the ACM, 1999
Consider the set ℋ of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good ℋ is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n
Noga Alon +4 more
openaire +3 more sources
Consider the set ℋ of all linear (or affine) transformations between two vector spaces over a finite field F . We study how good ℋ is as a class of hash functions, namely we consider hashing a set S of size n into a range having the same cardinality n
Noga Alon +4 more
openaire +3 more sources
Cryptologia, 2019
GOST-R 34.11-94 is a Russian standard cryptographic hash function that was introduced in 1994 by the Russian Federal Agency for the purposes of information processing, information security, and dig...
Khushboo Bussi +3 more
openaire +1 more source
GOST-R 34.11-94 is a Russian standard cryptographic hash function that was introduced in 1994 by the Russian Federal Agency for the purposes of information processing, information security, and dig...
Khushboo Bussi +3 more
openaire +1 more source
Learning to hash: forgiving hash functions and applications
Data Mining and Knowledge Discovery, 2008The problem of efficiently finding similar items in a large corpus of high-dimensional data points arises in many real-world tasks, such as music, image, and video retrieval. Beyond the scaling difficulties that arise with lookups in large data sets, the complexity in these domains is exacerbated by an imprecise definition of similarity. In this paper,
Shumeet Baluja, Michele Covell
openaire +1 more source
Collections of Functions for Perfect Hashing
SIAM Journal on Computing, 1986Summary: Hashing techniques for accessing a table without searching it are usually designed to perform efficiently on the average over all possible contents of the table. If the table contents are known in advance, we might be able to choose a hashing function with guaranteed efficient (worst-case) performance.
Francine Berman +4 more
openaire +2 more sources