Results 191 to 200 of about 1,098,148 (248)
Some of the next articles are maybe not open access.
Quantum Hashing via ε-Universal Hashing Constructions and Freivalds' Fingerprinting Schemas
Workshop on Descriptional Complexity of Formal Systems, 2014We 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.
F. Ablayev, M. Ablayev
semanticscholar +5 more sources
Reducing DRAM Refresh Rate Using Retention Time Aware Universal Hashing Redundancy Repair
ACM Trans. Design Autom. Electr. Syst., 2019As the device capacity of Dynamic Random Access Memory (DRAM) increases, refresh operation becomes a significant contributory factor toward total power consumption and memory throughput of the device.
Kyu Hyun Choi +3 more
semanticscholar +1 more source
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
semanticscholar +1 more source
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
semanticscholar +1 more source
TODE, 2017
Recently, scaling down dynamic random access memory (DRAM) has become more of a challenge, with more faults than before and a significant degradation in yield.
Jaeyung Jun +5 more
semanticscholar +1 more source
Recently, scaling down dynamic random access memory (DRAM) has become more of a challenge, with more faults than before and a significant degradation in yield.
Jaeyung Jun +5 more
semanticscholar +1 more source
Universal hash functions for an infinite universe and hash trees
Information Processing Letters, 2009In this note we describe the adaptation of the universal hashing idea to an infinite universe, and to prefix hash trees. These are a structure underlying all extendible hash methods, which have up to now only been studied under the uniform hashing assumption.
openaire +2 more sources
Exploring Targeted Universal Adversarial Attack for Deep Hashing
IEEE International Conference on Acoustics, Speech, and Signal ProcessingAlthough image-dependent adversarial attacks have been studied, the more challenging image-agnostic adversarial attack for deep hashing remains an unexplored territory. In this paper, we take the first attempt on the more efficient and malicious targeted
Fei Zhu +5 more
semanticscholar +1 more source
2012 Third International Conference on Emerging Applications of Information Technology, 2012
Lazy Learners are those that postpone building Classifier models until a new data tuple is presented. Case-Based Reasoners fall under the category of Lazy Learners.
C. Chaudhuri +2 more
semanticscholar +1 more source
Lazy Learners are those that postpone building Classifier models until a new data tuple is presented. Case-Based Reasoners fall under the category of Lazy Learners.
C. Chaudhuri +2 more
semanticscholar +1 more source
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
2009Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T 1 and T 2 each of which has m cells of capacity 1 such that constant access time is guaranteed. For m ≥ (1 + e)n and hash functions h 1, h 2 that are c logn-wise independent, Pagh [11] showed that the keys of an arbitrary set S can be stored using
Ulf Schellbach, Martin Dietzfelbinger
openaire +2 more sources
Universally composable anonymous Hash certification model [PDF]
Science in China Series F: Information Sciences, 2007 Ideal function is the fundamental component in the universally composable security model. However, the certification ideal function defined in the universally composable security model realizes the identity authentication by binding identity to messages and the signature, which fails to characterize the special security requirements of anonymous ...
SangJae Moon, Fan Zhang, Jianfeng Ma
openaire +1 more source