Results 151 to 160 of about 1,519 (199)
Some of the next articles are maybe not open access.
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
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
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 +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. Kadah, Hoda Osama, Amr Badr
exaly +2 more sources
Robust Video Hashing Based on Double-Layer Embedding
IEEE Signal Processing Letters, 2011A 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.
Jiande Sun, Xiushan Nie, Ju Liu
exaly +2 more sources
Double-Bit Quantization for Hashing
Proceedings of the AAAI Conference on Artificial Intelligence, 2021Hashing, 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
DOUBLE HASHING WITH MULTIPLE PASSBITS
International Journal of Foundations of Computer Science, 2003We present a novel extension to passbits providing significant reduction to unsuccessful search lengths for open addressing collision resolution hashing. Both the experimental and analytical results presented demonstrate the dramatic reductions possible.
Paul M. Martini, Walter A. Burkhard
openaire +2 more sources
More analysis of double hashing
Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88, 1988zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George S. Lueker, Mariko Molodowitch
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 +1 more source
Journal of the American Society for Information Science, 1972
AbstractThis paper generalizes the direct‐chaining technique of hash coding in a manner that is useful for storing records on the basis of non‐unique search keys. Such a capability is of particular interest for library automation and information retrieval. Two hash functions are used instead of one, and to take advantage of the information contained in
openaire +1 more source
AbstractThis paper generalizes the direct‐chaining technique of hash coding in a manner that is useful for storing records on the basis of non‐unique search keys. Such a capability is of particular interest for library automation and information retrieval. Two hash functions are used instead of one, and to take advantage of the information contained in
openaire +1 more source
The analysis of double hashing(Extended Abstract)
Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76, 1976In this paper we analyze the performance of a well known algorithm known as double hashing [Knuth]. In this method we probe the hash table along arithmetic progressions, where both the initial element and the increment of the progression are chosen randomly and independently depending only on the key K of the search.
Leonidas J. Guibas, Endre Szemerédi
openaire +1 more source
Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source