From cfd6ed9bba29a9dcd40562a317d28940c23cb39a Mon Sep 17 00:00:00 2001 From: evanbiederstedt Date: Tue, 29 Sep 2020 14:36:39 -0400 Subject: [PATCH] update DESCRIPTION --- DESCRIPTION | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/DESCRIPTION b/DESCRIPTION index 2e9b609..2097b10 100644 --- a/DESCRIPTION +++ b/DESCRIPTION @@ -1,8 +1,8 @@ Package: N2R Type: Package Title: Fast and Scalable Approximate k-Nearest Neighbor Search Methods using 'N2' Library -Version: 0.1.0 -Date: 2020-09-21 +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, , . License: Apache License 2.0