Results 41 to 50 of about 44,364 (200)

Recursive n-gram hashing is pairwise independent, at best [PDF]

open access: yes, 2010
Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values.
Carter   +12 more
core   +2 more sources

Finding succinct ordered minimal perfect hash functions [PDF]

open access: yesInformation Processing Letters, 1994
Abstract An ordered minimal perfect hash table is one in which no collisions occur among a predefined set of keys, no space is unused and the data are placed in the table in order. A new method for creating ordered minimal perfect hash functions is presented.
Steven S. Seiden, Daniel S. Hirschberg
openaire   +2 more sources

Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications [PDF]

open access: yes, 2019
In this paper we identify a new class of sparse near-quadratic random Boolean matrices that have full row rank over F_2 = {0,1} with high probability and can be transformed into echelon form in almost linear time by a simple version of Gauss elimination.
Dietzfelbinger, Martin, Walzer, Stefan
core   +3 more sources

Hardware Security for Edge Computing Via CMOS‐Compatible Multi‐Level Flash Memory with Hash‐Based Key Generation

open access: yesAdvanced Electronic Materials, EarlyView.
A CMOS‐compatible flash memory structure with multi‐level programming produces reliable and reproducible physically unclonable functions (PUFs) for secure IoT applications. Device‐specific variations in flat‐band voltage enable scalable key generation without standby power.
Kyumin Sim   +6 more
wiley   +1 more source

Quantum Key Distribution with Blind Polarization Bases [PDF]

open access: yes, 2005
We propose a new quantum key distribution scheme that uses the blind polarization basis. In our scheme the sender and the receiver share key information by exchanging qubits with arbitrary polarization angles without basis reconciliation.
Kim, Chil-Min   +3 more
core   +1 more source

К проблеме хеш-адресации без коллизий постоянного массива ключей [PDF]

open access: yes, 2007
In article the problem of designing of the perfect hash-addressing for a constant set of keys is investigated. The algorithm of designing of the perfect hash-addressing as hierarchical system of Boolean functions is developed.
Кузнецов, А. А.   +1 more
core  

It's Not Just What You Say, but How You Say It: The Effects of Enterprise Social Media on Service Management, Through the Lens of Signaling Theory

open access: yesHuman Resource Management, EarlyView.
ABSTRACT Frontline service workers are crucial to service delivery and have been a long‐standing focus of research, with scholars and practitioners alike maintaining an interest in their effective management. As technology increasingly transforms this context, the way in which managers in service organizations communicate with frontline workers has ...
Alexandra Budjanovcanin, Wei‐Ning Yang
wiley   +1 more source

A Risk Manager for Intrusion Tolerant Systems: Enhancing HAL 9000 With New Scoring and Data Sources

open access: yesSoftware: Practice and Experience, EarlyView.
ABSTRACT Background Intrusion Tolerant Systems (ITS) aim to maintain system security despite adversarial presence by limiting the impact of successful attacks. Current ITS risk managers rely heavily on public databases like NVD and Exploit DB, which suffer from long delays in vulnerability evaluation, reducing system responsiveness. Objective This work
Tadeu Freitas   +6 more
wiley   +1 more source

Blockchain and Digital Technologies in the Telecommunications Industry

open access: yesThunderbird International Business Review, EarlyView.
ABSTRACT This article examines how fourth industrial revolution (4IR) technologies, specifically blockchain and digital twin technologies, can be utilized to address the energy supply challenge and enhance the management of distributed telecom infrastructure assets in a research context.
Charles Okeyia   +3 more
wiley   +1 more source

Perfect Hash Function Generation on the GPU with RecSplit

open access: yes, 2022
Minimale perfekte Hashfunktionen (MPHFs) bilden eine statische Menge S von beliebigen Schlüsseln auf die Menge der ersten |S| natürlichen Zahlen bijektiv ab, d. h., jeder Hashwert wird exakt einmal verwendet. Sie sind in vielen Anwendungen hilfreich, zum Beispiel, um Hashtabellen mit garantiert konstanter Zugriffszeit zu implementieren.
openaire   +2 more sources

Home - About - Disclaimer - Privacy