Results 181 to 190 of about 3,836,696 (241)
hadge: a comprehensive pipeline for donor deconvolution in single-cell studies. [PDF]
Genome BiolCurion F +11 more
europepmc +1 more source
Group verifiable secure aggregate federated learning based on secret sharing. [PDF]
Sci RepZhou S, Wang L, Chen L, Wang Y, Yuan K.
europepmc +1 more source
Public sentiment and thematic evolution in the metaverse: A large-scale computational analysis of Twitter discourse. [PDF]
PLoS OneDuraivel S +3 more
europepmc +1 more source
Leakage-Resistant Evaluation of Gait Mat and Multisensor Biomechanical Features for Knee Osteoarthritis Screening: A Subject-Level Data Integrity Study. [PDF]
Bioengineering (Basel)Yang MA, Ha KS.
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,
Xin-Shun Xu, Zhen-Duo Chen, Xin Luo
exaly +4 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
Shengnan Wang, Chunguang Li
exaly +3 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
Shengnan Wang, Chunguang Li
exaly +3 more sources
Load Thresholds for Cuckoo Hashing with Double Hashing [PDF]
16th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2018), 2018 In k-ary cuckoo hashing, each of cn objects is associated with k random buckets in a hash table of size n. An l-orientation is an assignment of objects to associated buckets such that each bucket receives at most l objects.
M. Mitzenmacher +2 more
semanticscholar +7 more sources
Computing in Science and 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.
Amr Badr
exaly +3 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.
Amr Badr
exaly +3 more sources