Results 51 to 60 of about 167,829 (332)
Finding succinct ordered minimal perfect hashing functions [PDF]
, 1992 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 hashing functions is presented.
Hirschberg, Daniel S., Seiden, Steven S.
core
Advanced Science, EarlyView.Pulmonary hypertension (PH) is a progressive condition with high morbidity and mortality, largely owing to right ventricular (RV) failure resulting from maladaptive remodeling. Our study provides strong evidence in support of a critical, detrimental role for AXL as a previously unrecognized determinant driving RV fibrotic pathology in PH.
Li‐Wei Wu +17 more
wiley +1 more source
Coverless VoIP Steganography Using Hash and Hash
Cybernetics and Information Technologies, 2020 Performing secure and robust embedding and extracting in real time voice streams without deteriorating the voice quality is a great challenge. This paper aims on hiding the secret data bits in the voice packets without modifying any data in the cover ...
Deepikaa S., Saravanan R.
doaj +1 more source
Blockchain-powered distributed data auditing scheme for cloud-edge healthcare system
Cyber Security and Applications, 2023 Cloud-edge healthcare system provides storage and computing functions at the hospital servers, bringing low latency for doctors and patients. However, hospital servers cannot be trusted and have limited computing resources.
Yi Li, Meiqin Tang
doaj +1 more source
Advanced Science, EarlyView.NAD⁺ homeostasis maintains neuronal integrity through opposing actions of NMNAT2 and SARM1. Loss of NMNAT2 in glutamatergic neurons reprograms cortical metabolism from glucose to lipid catabolism, depletes lipid stores, and triggers inflammation and neurodegeneration.
Zhen‐Xian Niou +9 more
wiley +1 more source
On the insertion time of random walk cuckoo hashing
, 2017 Cuckoo Hashing is a hashing scheme invented by Pagh and Rodler. It uses $d\geq 2$ distinct hash functions to insert items into the hash table. It has been an open question for some time as to the expected time for Random Walk Insertion to add items.
Frieze, Alan, Johansson, Tony
core +1 more source
Proceedings of the 59th ACM/IEEE Design Automation Conference, 2022 Most cloud services and distributed applications rely on hashing algorithms that allow dynamic scaling of a robust and efficient hash table. Examples include AWS, Google Cloud and BitTorrent. Consistent and rendezvous hashing are algorithms that minimize key remapping as the hash table resizes.
Heddes, Mike +4 more
openaire +2 more sources
Methodologies for Sample Multiplexing and Computational Deconvolution in Single‐Cell Sequencing
Advanced Science, EarlyView.Sample multiplexing offers a critical solution for boosting throughput and minimizing batch effects in single‐cell sequencing. This review navigates the latest experimental methodologies and computational deconvolution algorithms, bridging the gap between wet‐lab design and analytical success.
Yufei Gao, Weiwei Yin, Wei Hu, Wei Chen
wiley +1 more source
Analysis and Test of Storage Algorithm of Card Reader of Personnel Positioning System
Gong-kuang zidonghua, 2012 The paper analyzed three storage algorithms of chain storage algorithm, hash table storage algorithm and hash binary tree storage algorithm which are applicable to the card reader of personnel positioning system in term of search time and storage ...
ZHANG Feng, XU Zhao, ZHANG Kai-ting
doaj
A hashing technique using separate binary tree
Data Science Journal, 2006 It is always a major demand to provide efficient retrieving and storing of data and information in a large database system. For this purpose, many file organization techniques have already been developed, and much additional research is still going on ...
Md Mehedi Masud +3 more
doaj +1 more source