Results 181 to 190 of about 1,013,929 (223)
Some of the next articles are maybe not open access.
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
Telecommunications and Radio Engineering (English Translation of Elektrosvyaz and Radiotekhnika), 2016
Yevgen V. Kotukh
exaly +2 more sources
Yevgen V. Kotukh
exaly +2 more sources
Universal hash functions for an infinite universe and hash trees
Information Processing Letters, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Information-theoretically secure quantum timestamping with one-time universal hashing
Science China Physics, Mechanics & AstronomyAccurate and tamper-resistant timestamps are essential for applications demanding verifiable chronological ordering, such as legal documentation and digital intellectual property protection. Classical timestamp protocols rely on computational assumptions
Ming-Yang Li +4 more
semanticscholar +1 more source
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, Wanqian Zhang, Dayan Wu
exaly +2 more sources
Hashing practice: analysis of hashing and universal hashing
ACM SIGMOD Record, 1988Much 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
2012
Universal hash functions are important building blocks for unconditionally secure message authentication codes. In this paper, we present a new construction of a class of e-Almost Strongly Universal2 hash functions with much smaller description (or key) length than the Wegman-Carter construction.
Aysajan Abidin, Jan-Åke Larsson
openaire +1 more source
Universal hash functions are important building blocks for unconditionally secure message authentication codes. In this paper, we present a new construction of a class of e-Almost Strongly Universal2 hash functions with much smaller description (or key) length than the Wegman-Carter construction.
Aysajan Abidin, Jan-Åke Larsson
openaire +1 more source
ROSE: Relational and Prototypical Structure Learning for Universal Domain Adaptive Hashing
IEEE Transactions on Information Forensics and SecurityAs an important problem in searching system development, domain adaptive retrieval seeks to train a retrieval model with both labeled source samples and unlabeled target samples.
Xinlong Yang +7 more
semanticscholar +1 more source