From 8330dfbe44119435fd7c89ffca012d095b37e51d Mon Sep 17 00:00:00 2001 From: Vitali Fedulov Date: Wed, 7 Feb 2024 21:02:09 +0100 Subject: [PATCH] - --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 0513256..be56494 100644 --- a/README.md +++ b/README.md @@ -9,6 +9,6 @@ Each vestor is discretized into a set of hashes, as described [here](https://vit 1) Provided a float vector []float64, use `CubeSet` and `CentralCube` functions to generate hypercube coordinates []int. The difference between the two functions is that one corresponds to hash-table record and the other to a query or vice versa, depending on performance/memory preference. 2) `HashSet` and `DecimalHash`/`FNV1aHash` are used to get corresponding hash set and central hash from the hypercube coordinates above. There are 2 alternative hash functions: DecimalHash and FNV1aHash. DecimalHash does not have collisions, but is not suitable for cases with large number of buckets or dimensions. FNV1aHash is applicable for all cases. -[Example](https://github.com/vitali-fedulov/imagehash/blob/master/hashes.go) for similar image search/clustering. +[Example](https://github.com/vitali-fedulov/imagehash/blob/master/hashes.go) for similar image search and clustering. [Go doc](https://pkg.go.dev/github.com/vitali-fedulov/hyper) for full code documentation.