Count-Min Sketches for Estimating Password Frequency within Hamming Distance Two (Q5300959)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Count-Min Sketches for Estimating Password Frequency within Hamming Distance Two |
scientific article; zbMATH DE number 6182581
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Count-Min Sketches for Estimating Password Frequency within Hamming Distance Two |
scientific article; zbMATH DE number 6182581 |
Statements
Count-Min Sketches for Estimating Password Frequency within Hamming Distance Two (English)
0 references
28 June 2013
0 references
count-min sketch
0 references
Bloom filter
0 references
password frequency
0 references
approximate string matching
0 references
0.80033755
0 references
0.79280436
0 references
0 references
0.77994204
0 references
0 references
0.7714782
0 references
