Results 41 to 50 of about 170,367 (287)
Research of a Scheduling Optimization algorithm based on Hash Adapter
MATEC Web of Conferences, 2017 The performance of hash-based Scheduling optimization algorithm for network flow cannot be bounded under the worst-case because of hash conflicts. To make up for the shortage of the above algorithm, a multiple-hash algorithm based on counting Hash ...
Yang Wenchuan, Fu Zhen, Zuo Wen
doaj +1 more source
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
More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
, 2015 We explicitly construct random hash functions for privacy amplification (extractors) that require smaller random seed lengths than the previous literature, and still allow efficient implementations with complexity $O(n\log n)$ for input length $n$.
Hayashi, Masahito, Tsurumaru, Toyohiro
core +1 more source
Advanced Healthcare Materials, EarlyView.Platform system to create biofabricated 3D spinal cord tissue models: Combining high resolution PCL fiber placement, a customized, hyaluronic acid‐based hydrogel, two cell types (spinal cord neurons and astrocytes) together with three distinct laminin isoforms allow the formation of functional cell–cell network interactions.
Nicoletta Murenu +12 more
wiley +1 more source
Robust Hashing Based on Quaternion Gyrator Transform for Image Authentication
IEEE Access, 2020 Image hashing is one of the most effective methods in many image processing applications including image recognition or authentication, tampering detection, image retrieval, etc.
Junlin Ouyang, Xiao Zhang, Xingzi Wen
doaj +1 more source
A Cross-Modal Hash Retrieval Method with Fused Triples
Applied Sciences, 2023 Due to the fast retrieval speed and low storage cost, cross-modal hashing has become the primary method for cross-modal retrieval. Since the emergence of deep cross-modal hashing methods, cross-modal retrieval significantly improved.
Wenxiao Li +6 more
doaj +1 more source
Fast Supervised Hashing with Decision Trees for High-Dimensional Data [PDF]
, 2014 Supervised hashing aims to map the original features to compact binary codes that are able to preserve label based similarity in the Hamming space.
Hengel, Anton van den +4 more
core +3 more sources
Advanced Materials, EarlyView.A PVA‐based macromolecular thiol‐ene formulation enables efficient two‐photon polymerization at extremely low polymer concentrations and high writing speeds of 400 mm s−1 (20×), allowing high‐fidelity laser writing of cell‐interactive hydrogel structures on demand.
Wanwan Qiu +6 more
wiley +1 more source
Hashing with binary autoencoders
, 2015 An attractive approach for fast search in image databases is binary hashing, where each high-dimensional, real-valued image is mapped onto a low-dimensional, binary vector and the search is done in this binary space.
Carreira-Perpiñán, Miguel Á. +1 more
core +1 more source
Software methods for fast hashing
Transactions on Networks and Communications, 2015 The carry-less multiplication instruction, PCLMULQDQ, is a relatively recent addition to the x86-64 instructions set. It multiplies two binary polynomials of degree , using arithmetic, and produces a polynomial of degree , stored in a -bit register. PCLMULQDQ is intended to speed up computations in , which are used for AES-GCM authenticated encryption.
openaire +2 more sources