Results 161 to 170 of about 20,383 (214)
Some of the next articles are maybe not open access.
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.
Martini, Paul M., Burkhard, Walter A.
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 +1 more source
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 +1 more source
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 +1 more source
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 +1 more source
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.
Lueker, George S., Molodowitch, Mariko
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
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
Remainder Quotient Double Hashing Technique in Closed Hashing Search Process
SSRN Electronic Journal, 2019Searching is one of the most important process in many activities to access the data or elements. It can be done both in online and offline mode. Many algorithms are used in data structure to perform search process. Hash search algorithm is one of them which are independent of the number of elements inserted into the table.
STUTI PANDEY, Abhay Kumar Agarwal
openaire +1 more source
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 +1 more source
Attacks on Fast Double Block Length Hash Functions
Journal of Cryptology, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Knudsen, Lars R. +2 more
openaire +1 more source