From 1040b4f3a9b6444d3b75612d9d3a404bb7329bfa Mon Sep 17 00:00:00 2001 From: Vitali Fedulov Date: Thu, 12 May 2022 01:22:15 +0200 Subject: [PATCH] - --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 4e295b6..bd618a1 100644 --- a/README.md +++ b/README.md @@ -2,7 +2,7 @@ Search nearest neighbour vectors in n-dimensional space with hashes. There are no dependencies in this package. -Each vestor is discretized into a set of hashes, as described [here](https://vitali-fedulov.github.io/algorithm-for-hashing-high-dimensional-float-vectors.html) (also as [PDF](https://github.com/vitali-fedulov/research/blob/main/Algorithm%20for%20hashing%20float%20vectors.pdf)). +Each vestor is discretized into a set of hashes, as described [here](https://vitali-fedulov.github.io/similar.pictures/algorithm-for-hashing-high-dimensional-float-vectors.html) (also as [PDF](https://github.com/vitali-fedulov/research/blob/main/Algorithm%20for%20hashing%20float%20vectors.pdf)). Usage sequence: 1) CubeSet or CentralCube, depending which one is used for a database record and which one for a query.