Results 181 to 190 of about 2,100,258 (259)

Optical Fiber Probe with Integrated Micro-Optical Filter for Raman and Surface-Enhanced Raman Scattering Sensing. [PDF]

Nanomaterials (Basel)
Al Mamun MA, Katkus T, Mahadevan-Jansen A, Juodkazis S, Stoddart PR.   +4 more
europepmc   +1 more source

Quantum-resilient software security: A fuzzy AHP-based assessment framework in the era of quantum computing. [PDF]

PLoS One
Almotiri SH.
europepmc   +1 more source

Tissue determinants of the human T cell receptor repertoire.

Sureshchandra S, Henderson J, Levendosky E, Bhattacharyya S, Kastenschmidt JM, Sorn AM, Mitul MT, Benchorin A, Batucal K, Daugherty A, Murphy SJ, Thakur C, Trask D, Ahuja G, Moisan A, Tiffeau-Mayer A, Saligrama N, Wagar LE.   +17 more
europepmc   +1 more source

External Double Hashing with Choice

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05), 2006
A novel extension to external double hashing providing significant reduction to both successful and unsuccessful search lengths is presented. The experimental and analytical results demonstrate the reductions possible. This method does not restrict the hashing table configuration parameters and utilizes very little additional storage space per bucket ...
Walter A. Burkhard
semanticscholar   +4 more sources

Some of the next articles are maybe not open access.

Related searches:

Fine-Grained Hashing With Double Filtering

IEEE Transactions on Image Processing, 2022
Fine-grained hashing is a new topic in the field of hashing-based retrieval and has not been well explored up to now. In this paper, we raise three key issues that fine-grained hashing should address simultaneously, i.e., fine-grained feature extraction, feature refinement as well as a well-designed loss function.
Zhen-Duo Chen, Xin Luo, Yongxin Wang, Shanqing Guo, Xin-Shun Xu   +4 more
openaire   +3 more sources

Double Hashing Sort Algorithm

Computing in Science & Engineering, 2017
In the past few years, researchers have introduced several sorting algorithms to enhance time complexity, space complexity, and stability. A double hashing methodology first collects statistics about element distribution and then maps between elements of the array and indexes based on the knowledge collected during the first hashing.
Yasser M. K. Omar, Amr Badr, Hoda Osama
openaire   +3 more sources

Double-Hashing Operation Mode for Encryption

2017 IEEE 7th Annual Computing and Communication Workshop and Conference (CCWC), 2017
Block ciphers, hash-based encryption, and public-key ciphers are examples of data encryption techniques with different desired features. Strong block ciphers, like AES, must run in some mode of operation to encrypt data larger than the block size. Public-key ciphers, like RSA, are costly and usually used for key-sharing rather than encrypting the data ...
Sultan Almuhammadi, Ahmad Amro
openaire   +3 more sources

Remainder Quotient Double Hashing Technique in Closed Hashing Search Process

SSRN Electronic Journal, 2019
Searching is one of the most important process in many activities to access the data or elements. It can be done both in online and offline mode. Many algorithms are used in data structure to perform search process. Hash search algorithm is one of them which are independent of the number of elements inserted into the table.
Stuti Pandey, Abhay Kumar Agarwal
openaire   +3 more sources

Discrete Double-bit Hashing

IEEE Transactions on Big Data, 2019
Hashing has been widely used for nearest neighbors search over big data. Hashing encodes high dimensional data points into binary codes. Most hashing methods use the single-bit quantization (SBQ) strategy for coding the data. However, this strategy often encodes neighboring points into totally different bits.
Chunguang Li, Shengnan Wang
openaire   +3 more sources