Výsledky vyhledávání - "Tabulation hashing"

Perfect Tabular Hashing in Pseudolinear Time

Publikováno v: CCWC

We present an algorithm for generating perfect tabulation hashing functions by reduction to Boolean satisfaction (SAT). Tabulation hashing is a high-performance family of hash functions for hash tables that involves computing the XOR of random lookup

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d56a40270ba10b052a0fa1dbfced1caf
https://doi.org/10.1109/ccwc51732.2021.9375992

Zobrazit plný text záznamu

Fast hashing with Strong Concentration Bounds

Autor: Peter M. R. Rasmussen, Mikkel Thorup, Mathias Bæk Tejs Knudsen, Anders Aamand, Jakob Bæk Tejs Knudsen

Publikováno v: Aamand, A, Knudsen, J B T, Knudsen, M B T, Rasmussen, P M R & Thorup, M 2020, Fast hashing with strong concentration bounds . in K Makarychev, Y Makarychev, M Tulsiani, G Kamath & J Chuzhoy (eds), STOC 2020-Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing . Association for Computing Machinery, Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 1265-1278, 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, United States, 22/06/2020 . https://doi.org/10.1145/3357713.3384259
STOC

Previous work on tabulation hashing by Patrascu and Thorup from STOC'11 on simple tabulation and from SODA'13 on twisted tabulation offered Chernoff-style concentration bounds on hash based sums, e.g., the number of balls/keys hashing to a given bin,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b32f2d2ca37fd4e9fbcbde8c0a5da07d
http://arxiv.org/abs/1905.00369

Zobrazit plný text záznamu

Hashing Key Based Analysis of Polynomial Encryption Standard

Autor: Pic Sonia, Surender Kumar Grewal

Publikováno v: International Journal of Computer Network and Information Security. 8:44-51

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b2a4abb3434de787d918708ad32986ff
https://doi.org/10.5815/ijcnis.2016.11.05

Zobrazit plný text záznamu

Accelerated Manhattan hashing via bit-remapping with location information

Autor: Zijia Lin, Guiguang Ding, Jisheng Pei, Wenshuo Chen

Publikováno v: Multimedia Tools and Applications. 76:2441-2466

Hashing is a binary-code encoding method which tries to preserve the neighborhood structures in the original feature space, in order to realize efficient approximate nearest neighbor search in large-scale databases. Existing hashing methods usually a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8935379eee8ab2e3390ad1e5b0f74e19
https://doi.org/10.1007/s11042-015-3217-x

Zobrazit plný text záznamu

A seven-dimensional analysis of hashing methods and its implications on query processing

Autor: Stefan Richter, Victor Alvarez, Jens Dittrich

Publikováno v: Proceedings of the VLDB Endowment. 9:96-107

Hashing is a solved problem. It allows us to get constant time access for lookups. Hashing is also simple. It is safe to use an arbitrary method as a black box and expect good performance, and optimizations to hashing can only improve it by a negligi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bb583e46363b2de4bf27d220be0825c8
https://doi.org/10.14778/2850583.2850585

Zobrazit plný text záznamu

Locality Sensitive Hashing with Extended Partitioning Boundaries

Autor: Keon Myung Lee

Publikováno v: Applied Mechanics and Materials. :804-807

Locality-sensitive hashing is a technique to allow approximate nearest search for large volume of data in a fast manner. Binary code locality-sensitive hashing distributes a data set into buckets labeled with binary code, where binary codes are deter

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::85978d0272dd4b187e8d3e7aec18a48d
https://doi.org/10.4028/www.scientific.net/amm.321-324.804

Zobrazit plný text záznamu

In Defense of Locality-Sensitive Hashing

Autor: Shiming Xiang, Chunlei Huo, Chunhong Pan, Bin Fan, Kun Ding

Publikováno v: IEEE transactions on neural networks and learning systems. 29(1)

Hashing-based semantic similarity search is becoming increasingly important for building large-scale content-based retrieval system. The state-of-the-art supervised hashing techniques use flexible two-step strategy to learn hash functions. The first

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e04f9bb1ed8dcc87eab69fc58ea1da2d
https://pubmed.ncbi.nlm.nih.gov/28113786

Zobrazit plný text záznamu

Universal hashing

Autor: Jürgen Bierbrauer

Publikováno v: Introduction to Coding Theory ISBN: 9781315371993
Introduction to Coding Theory
Introduction to Coding Theory ISBN: 9781315273082

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4dbe8c40da7cbcb3b063c92b5084d297
https://doi.org/10.1201/9781315371993-7

Zobrazit plný text záznamu

FUZZY UNIVERSAL HASHING AND APPROXIMATE AUTHENTICATION

Autor: Dongvu Tonien, Reihaneh Safavi-Naini

Publikováno v: Discrete Mathematics, Algorithms and Applications. :587-607

Traditional data authentication systems are sensitive to single bit changes and so are unsuitable for message spaces that are naturally "fuzzy" where "similar" messages are considered "the same" or indistinguishable. In this paper, we study unconditi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c82459926367f19b61ad3205cc2da644
https://doi.org/10.1142/s1793830911001425

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání