4 ms·

Any relation to: https://en.wikipedia.org/wiki/Rolling_hash https://en.wikipedia.org/wiki/Rolling_hash ? Also I wonder if hexagonal lattices were a better choi

Any relation to: https://en.wikipedia.org/wiki/Rolling_hash https://en.wikipedia.org/wiki/Rolling_hash ? Also I wonder if hexagonal lattices were a better choice for the 2D use case. Having multiple randomly sized, shifted and rotated hexagonal lattices would come very close to: https://en.wikipedia.org/wiki/Grid_cell https://en.wikipedia.org/wiki/Grid_cell

nextaccountic 5y ago
I also wish to know! Specially because https://en.wikipedia.org/wiki/Locality-sensitive_hashing https://en.wikipedia.org/wiki/Locality-sensitive_hashing says "See also: Rolling hash" (and a bunch of other things like bloom filters and wavelet compression) The best I can find is https://medium.com/@glaslos/locality-sensitive-fuzzy-hashing-66127178ebdc https://medium.com/@glaslos/locality-sensitive-fuzzy-hashing... in which SSDEEP apparently uses a rolling hash to implement locality sensitive fuzzy hashing ssdeep would be a fuzzy hashing program https://ssdeep-project.github.io/ssdeep/index.html https://ssdeep-project.github.io/ssdeep/index.html