Results 161 to 170 of about 1,687 (211)

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

Double Hashing Sort Algorithm

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.
Yasser M. Kadah, Hoda Osama, Amr Badr
exaly   +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
core   +3 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
exaly   +3 more sources

Double hashing with passbits

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Walter A Burkhard
openaire   +2 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
exaly   +2 more sources

More analysis of double hashing

Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George S. Lueker, Mariko Molodowitch
openaire   +3 more sources

Peeling arguments and double hashing

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2012
The 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