From 5ae1e682590cdfda7f1b42f6bfceb718485a29f1 Mon Sep 17 00:00:00 2001 From: evanbiederstedt Date: Tue, 10 Nov 2020 22:41:16 -0500 Subject: [PATCH] Update DESCRIPTION --- DESCRIPTION | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/DESCRIPTION b/DESCRIPTION index 2e64be2..2097b10 100644 --- a/DESCRIPTION +++ b/DESCRIPTION @@ -1,7 +1,7 @@ Package: N2R Type: Package Title: Fast and Scalable Approximate k-Nearest Neighbor Search Methods using 'N2' Library -Version: 0.1.1. +Version: 0.1.1 Date: 2020-09-29 Authors@R: c(person("Peter", "Kharchenko", email = "Peter_Kharchenko@hms.harvard.edu", role = c("aut")), person("Viktor", "Petukhov", email = "viktor.s.petukhov@ya.ru", role = c("aut")), person("Dirk", "Eddelbuettel", email="edd@debian.org", role=c("ctb")), person("Evan", "Biederstedt", email = "evan.biederstedt@gmail.com", role=c("cre", "aut"))) Description: Implements methods to perform fast approximate K-nearest neighbor search on input matrix. Algorithm based on the 'N2' implementation of an approximate nearest neighbor search using hierarchical Navigable Small World (NSW) graphs. The original algorithm is described in "Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs", Y. Malkov and D. Yashunin, , .