Results 51 to 60 of about 18,375 (213)
On an almost-universal hash function family with applications to authentication and secrecy codes [PDF]
Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. MMH$^*$, which was shown to be $\Delta$-universal by Halevi and Krawczyk in 1997, is a well-known universal hash function family.
Bibak, Khodakhast +3 more
core +1 more source
Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence
Simple tabulation dates back to Zobrist in 1970. Keys are viewed as c characters from some alphabet A. We initialize c tables h_0, ..., h_{c-1} mapping characters to random hash values.
Thorup, Mikkel
core +1 more source
ABSTRACT Purpose To develop a self‐supervised scan‐specific deep learning framework for reconstructing accelerated multiparametric quantitative MRI (qMRI). Methods We propose REFINE‐MORE (REference‐Free Implicit NEural representation with MOdel REinforcement), combining an implicit neural representation (INR) architecture with a model reinforcement ...
Ruimin Feng +3 more
wiley +1 more source
When executing a program or storing data in a medical Internet of Things (mIoT) system, physical side-channels analysis, such as recent-timing, cold-reboot, and virtual-machine attacks, might obtain partial information about internal sensitive medical ...
Mingwu Zhang +3 more
doaj +1 more source
ABSTRACT Structural Complexity is perceived as driving cost in system development, yet managing it effectively requires empirical understanding. This study investigates human decision‐making using a toy transportation‐style network design task, focusing on how Structural Complexity, Effort, and Performance interact. Seventy‐four participants (primarily
Alfonso Lanza +3 more
wiley +1 more source
Hash Tables as Engines of Randomness at the Limits of Computation: A Unified Review of Algorithms
Hash tables embody a paradox of deterministic structure that emerges from controlled randomness. They have evolved from simple associative arrays into algorithmic engines that operate near the physical and probabilistic limits of computation. This review
Paul A. Gagniuc, Mihai Togan
doaj +1 more source
Our study presents a tumour‐informed circulating tumour DNA (ctDNA) workflow designed to enhance the detection of recurrence in head and neck cancer patients, addressing key challenges such as low ctDNA tumour fractions and tumour heterogeneity. Abstract Circulating tumour DNA (ctDNA) is a promising minimally invasive biomarker for monitoring treatment
Xiaomin Huang +8 more
wiley +1 more source
A secured cloud‐medical data sharing with A‐BRSA and Salp ‐Ant Lion Optimisation Algorithm
Abstract Sharing medical data among healthcare providers, researchers, and patients is crucial for efficient healthcare services. Cloud‐assisted smart healthcare (s‐healthcare) systems have made it easier to store EHRs effectively. However, the traditional encryption algorithms used to secure this data can be vulnerable to attacks if the encryption key
Adel Binbusayyis +7 more
wiley +1 more source
Abstract Cultural entrepreneurship research emphasizes entrepreneurs’ use of cultural resources to influence audience evaluations through resonance. However, the process by which such cultural resonance is achieved remains underexplored, particularly as an intermediary outcome.
Xiumei Li +3 more
wiley +1 more source
Universal classes of hash functions
AbstractThis paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of ...
Carter, J.Lawrence, Wegman, Mark N.
openaire +2 more sources

