Search results
Jump to navigation
Jump to search
Page title matches
- ...this method to arbitrary fixed-length keys. Generalizations of tabulation hashing have also been developed that can handle variable-length keys such as text ...is not 4-independent. More sophisticated but slower variants of tabulation hashing extend the method to higher degrees of independence. ...19 KB (2,900 words) - 14:24, 2 September 2024
- ...e array]]. In addition to its use for encoding non-numeric values, feature hashing can also be used for [[dimensionality reduction]].<ref name="Weinberger" /> ...//www.virusbulletin.com/virusbulletin/2009/11/collaborative-spam-filtering-hashing-trick}}</ref> ...20 KB (3,114 words) - 19:26, 13 May 2024
- '''Static hashing''' is a form of [[Hash function|hashing]] where lookups are performed on a finalized dictionary set (all objects in ...tp://www.usna.edu/Users/cs/roche/courses/s13si486d/u04/#static-and-perfect-hashing| author-link = }}</ref> == ...3 KB (482 words) - 01:07, 19 November 2023
- [[File:Rendezvous Hash Schematic.png|thumb|Rendezvous Hashing with ''n=12, k=4.'' Clients ''C<sub>1</sub>'' and ''C<sub>4</sub>'' indepen '''Rendezvous '''or '''highest random weight (HRW) hashing'''<ref name=":0">{{cite web|last = Thaler|first = David|author2 = Chinya Ra ...31 KB (4,870 words) - 23:24, 10 November 2024
- '''Spiral hashing''', also known as '''Spiral Storage''' is an extensible ...I | last2=Lee | first3= Wann-Bay | last3=ChangLiaw | title = Linear spiral hashing for expansible files | journal = IEEE Transactions on Knowledge and Data En ...4 KB (526 words) - 12:49, 13 August 2023
- In [[computer science]], '''dynamic perfect hashing''' is a programming technique for resolving [[hash collision|collisions]] i ...c%20Perfect%20Hashing-%20Upper%20and%20Lower%20Bounds.pdf "Dynamic Perfect Hashing: Upper and Lower Bounds"] {{Webarchive|url=https://web.archive.org/web/2016 ...13 KB (1,970 words) - 19:23, 23 December 2024
- {{DISPLAYTITLE:''k''-independent hashing}} The goal of hashing is usually to map keys from some large domain (universe) <math>U</math> int ...15 KB (2,115 words) - 15:49, 17 October 2024
Page text matches
- '''Static hashing''' is a form of [[Hash function|hashing]] where lookups are performed on a finalized dictionary set (all objects in ...tp://www.usna.edu/Users/cs/roche/courses/s13si486d/u04/#static-and-perfect-hashing| author-link = }}</ref> == ...3 KB (482 words) - 01:07, 19 November 2023
- '''Spiral hashing''', also known as '''Spiral Storage''' is an extensible ...I | last2=Lee | first3= Wann-Bay | last3=ChangLiaw | title = Linear spiral hashing for expansible files | journal = IEEE Transactions on Knowledge and Data En ...4 KB (526 words) - 12:49, 13 August 2023
- Both [[computer vision]] techniques and [[locality-sensitive hashing]] (LSH) are used in the VisualRank [[algorithm]]. Consider an image search ...ng is then applied to these feature vectors using the [[locality-sensitive hashing#Methods|p-stable distribution scheme]]. In addition to this, LSH amplifica ...3 KB (421 words) - 03:36, 15 November 2023
- | title = Bloom Filters, Cuckoo Hashing, Cuckoo Filters, Adaptive Cuckoo Filters, and Learned Bloom Filters A cuckoo filter uses a hash table based on [[cuckoo hashing]] to store the [[fingerprint (computing)|fingerprint]]s of items.<ref name= ...7 KB (1,077 words) - 23:05, 28 July 2024
- In [[computer science]], '''dynamic perfect hashing''' is a programming technique for resolving [[hash collision|collisions]] i ...c%20Perfect%20Hashing-%20Upper%20and%20Lower%20Bounds.pdf "Dynamic Perfect Hashing: Upper and Lower Bounds"] {{Webarchive|url=https://web.archive.org/web/2016 ...13 KB (1,970 words) - 19:23, 23 December 2024
- ...this method to arbitrary fixed-length keys. Generalizations of tabulation hashing have also been developed that can handle variable-length keys such as text ...is not 4-independent. More sophisticated but slower variants of tabulation hashing extend the method to higher degrees of independence. ...19 KB (2,900 words) - 14:24, 2 September 2024
- {{DISPLAYTITLE:''k''-independent hashing}} The goal of hashing is usually to map keys from some large domain (universe) <math>U</math> int ...15 KB (2,115 words) - 15:49, 17 October 2024
- == Hashing bound for Pauli channels == ...re exists a stabilizer [[quantum error-correcting code]] that achieves the hashing limit <math>R=1-H\left(\mathbf{p}\right)</math> for a Pauli channel of the ...10 KB (1,677 words) - 09:20, 1 November 2022
- ...e array]]. In addition to its use for encoding non-numeric values, feature hashing can also be used for [[dimensionality reduction]].<ref name="Weinberger" /> ...//www.virusbulletin.com/virusbulletin/2009/11/collaborative-spam-filtering-hashing-trick}}</ref> ...20 KB (3,114 words) - 19:26, 13 May 2024
- === Simple hashing === ...1=Marx|first1=Matthias|url=http://dl.gi.de/handle/20.500.12116/16294|title=Hashing of personally identifiable information is not sufficient|last2=Zimmer|first ...8 KB (1,139 words) - 22:44, 21 November 2024
- [[File:Rendezvous Hash Schematic.png|thumb|Rendezvous Hashing with ''n=12, k=4.'' Clients ''C<sub>1</sub>'' and ''C<sub>4</sub>'' indepen '''Rendezvous '''or '''highest random weight (HRW) hashing'''<ref name=":0">{{cite web|last = Thaler|first = David|author2 = Chinya Ra ...31 KB (4,870 words) - 23:24, 10 November 2024
- ...t, by placing these <math>2^n</math> hash values as leaves and recursively hashing to form a binary tree. Let <math>a_{i,j}</math> denote the node in the tree ...ture of <math>M</math>, the receiver computes <math>A_0 = H(Y_i)</math> by hashing the public key of the one-time signature. For <math>j = 1, \ldots, n - 1</m ...8 KB (1,383 words) - 21:07, 21 February 2025
- '''bcrypt''' is a [[password-hashing function]] designed by [[Niels Provos]] and David Mazières, based on the [[ ...SUSE]] |quote=SUSE's crypt() implementation supports the blowfish password hashing function (id $2a) and system logins by default also use this method.}}</ref ...27 KB (3,896 words) - 05:14, 28 February 2025
- ...tions:<ref name="w">{{cite thesis| type=PhD | title=Random hypergraphs for hashing-based data structures.|first1=Walzer|last1=Stefan|year=2020|pages=27–30|url [[File:Cuckoo perfect hashing with indices.svg|thumb|Hash functions that lead to insertions are used to b ...10 KB (1,571 words) - 15:40, 29 July 2024
- ...first2=Ping |date=2015-07-12 |title=Improved asymmetric locality sensitive hashing (ALSH) for Maximum Inner Product Search (MIPS) |url=https://dl.acm.org/doi/ ...3 KB (449 words) - 20:45, 13 May 2024
- .../password-hashing.net/|title=Password Hashing Competition|website=password-hashing.net|access-date=2016-03-22}}</ref> which was won by [[Argon2]]. It is also ...=P.|last4=Santos|first4=P.|date=2016-01-01|title=Lyra2: efficient password hashing with high security against time-memory trade-offs|journal=IEEE Transactions ...18 KB (2,642 words) - 02:09, 24 December 2024
- * [[Feature hashing]] * [[Locality-sensitive hashing]] ...10 KB (1,527 words) - 09:42, 17 November 2024
- | title=SWIFFT: A Modest Proposal for FFT Hashing * '''Universal hashing.''' The SWIFFT family of functions is [[Universal hashing|universal]]. This means that for any fixed distinct {{Mvar|x}} and {{Mvar|y ...13 KB (1,961 words) - 23:56, 19 October 2024
- ...s a [[message authentication code]] (MAC) based on the idea of [[universal hashing]] and was developed{{when |date=October 2024}} by Boesgaard, Scavenius, Ped ==MMH (Multilinear Modular Hashing)== ...17 KB (2,800 words) - 13:42, 17 October 2024
- ...sh''' (or the '''min-wise independent permutations''' [[locality sensitive hashing]] scheme) is a technique for quickly estimating how [[Similarity measure|si | title=Exact weighted minwise hashing in constant time ...25 KB (3,578 words) - 06:17, 14 November 2024