Results 181 to 190 of about 2,157,663 (242)
A two-phase spatiotemporal chaos-based protocol for data integrity in IoT. [PDF]
Sci RepAlkhonaini MA +3 more
europepmc +1 more source
CELLeBT: exploring physical B cell-T cell clonal interactions through single-cell multi-omics
Bashford-Rogers R +9 more
europepmc +1 more source
Microglial response to amyloid-β pathology is modulated by X chromosome dosage
Arancibia-Carcamo IL +9 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Fine-Grained Hashing With Double Filtering
IEEE Transactions on Image Processing, 2022Fine-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 +4 more
openaire +3 more sources
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, Hoda Osama, Amr Badr
openaire +2 more sources
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, Hoda Osama, Amr Badr
openaire +2 more sources
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.
Shengnan Wang, Chunguang Li
openaire +2 more sources
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.
Shengnan Wang, Chunguang Li
openaire +2 more sources
Double-Hashing Operation Mode for Encryption
2017 IEEE 7th Annual Computing and Communication Workshop and Conference (CCWC), 2017Block 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 +2 more sources
Peeling arguments and double hashing
2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012The analysis of several algorithms and data structures can be reduced to the analysis of the following greedy “peeling” process: start with a random hypergraph; find a vertex of degree at most k, and remove it and all of its adjacent hyperedges from the graph; repeat until there is no suitable vertex.
Michael Mitzenmacher, Justin Thaler
openaire +2 more sources