Results 51 to 60 of about 168,960 (287)
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
Machine Learning for Green Solvents: Assessment, Selection and Substitution
Advanced Science, EarlyView.Environmental regulations have intensified demand for green solvents, but discovery is limited by Solvent Selection Guides (SSGs) that quantify solvent sustainability. Training a machine learning model on GlaxoSmithKline SSG, a database of sustainability metrics for 10,189 solvents, GreenSolventDB is developed. Integrated with Hansen solubility metrics,
Rohan Datta +4 more
wiley +1 more source
Proceedings of the 2018 Symposium on Architectures for Networking and Communications Systems, 2018 Hash tables are an essential data-structure for numerous networking applications (e.g., connection tracking, firewalls, network address translators). Among these, cuckoo hash tables provide excellent performance by allowing lookups to be processed with very few memory accesses (2 to 3 per lookup). Yet, for large tables, cuckoo hash tables remain memory
openaire +2 more sources
Neural Fields for Highly Accelerated 2D Cine Phase Contrast MRI
Advanced Science, EarlyView.ABSTRACT 2D cine phase contrast (CPC) MRI provides quantitative information on blood velocity and flow within the human vasculature. However, data acquisition is time‐consuming, motivating the reconstruction of the velocity field from undersampled measurements to reduce scan times. In this work, neural fields are proposed as a continuous spatiotemporal
Pablo Arratia +7 more
wiley +1 more source
Avoiding Rotated Bitboards with Direct Lookup [PDF]
, 2007 This paper describes an approach for obtaining direct access to the attacked squares of sliding pieces without resorting to rotated bitboards. The technique involves creating four hash tables using the built in hash arrays from an interpreted, high level
Tannous, Sam
core
Advanced Science, EarlyView.INB3P is a multimodal framework for blood–brain barrier‐penetrating peptide prediction under extreme data scarcity and class imbalance. By combining physicochemical‐guided augmentation, sequence–structure co‐attention, and imbalance‐aware optimization, it improves predictive performance and interpretability.
Jingwei Lv +11 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
Tight Thresholds for Cuckoo Hashing via XORSAT
, 2010 We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a single key.
Dietzfelbinger, Martin +5 more
core +2 more sources
CPHASH: A cache-partitioned hash table [PDF]
, 2011 CPHash is a concurrent hash table for multicore processors. CPHash partitions its table across the caches of cores and uses message passing to transfer lookups/inserts to a partition.
Kaashoek, M. Frans +2 more
core +2 more sources