Results 101 to 110 of about 20,415 (157)

Cascading quantum walks with Chebyshev map for designing a robust medical image encryption algorithm. [PDF]

Sci Rep
Alblehai F, El-Latif AAA, Pławiak P, Abd-El-Atty B.   +3 more
europepmc   +1 more source

Time trends in newly recorded diagnoses of 19 long term conditions before, during, and after the covid-19 pandemic: population based cohort study in England using OpenSAFELY.

BMJ
Russell MD, Schaffer A, Bechman K, Gibson M, Massey J, Higgins R, MacKenna B, Inglesby P, Bacon S, Mehrkar A, Goldacre B, Alveyn E, Allen V, Yang Z, Patel S, Adas MA, Sandhu G, Price E, Gama RM, Bramham K, Hotopf M, Norton S, Cope AP, Galloway JB.   +23 more
europepmc   +1 more source

Behavioral Time Scale Synaptic Plasticity (BTSP) endows Hyperdimensional Computing with brain-like information retrieval flexibility

Maass W, Yu C, Wu Y, Wang A.
europepmc   +1 more source

CELLeBT: exploring physical B cell-T cell clonal interactions through single-cell multi-omics

Bashford-Rogers R, Shohan MUS, Tucci F, Antanaviciute A, Pernes J, Walker C, Wu S, Overend L, Leedham S, Koohy H.   +9 more
europepmc   +1 more source

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   +4 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.
Shengnan Wang, Chunguang Li
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, Hoda Osama, Amr Badr
openaire   +3 more sources

Robust Video Hashing Based on Double-Layer Embedding

IEEE Signal Processing Letters, 2011
A robust video hashing scheme for video content identification and authentication is proposed, which is called Double-Layer Embedding scheme. Intra-cluster Locally Linear Embedding (LLE) and inter-cluster Multi-Dimensional Scaling (MDS) are used in the scheme.
null Xiushan Nie, null Ju Liu, null Jiande Sun, null Wei Liu   +3 more
openaire   +3 more sources

Double-Bit Quantization for Hashing

Proceedings of the AAAI Conference on Artificial Intelligence, 2021
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to its fast query speed and low storage cost. Because it is NP hard to directly compute the best binary codes for a given data set, mainstream hashing methods ...
Weihao Kong, Wu-Jun Li
openaire   +1 more source