Updated DESCRIPTION and NEWS.md

ntarabelloni · ntarabelloni · commit e612f23d94cf · 2016-07-06T18:04:29.000+02:00
diff --git a/DESCRIPTION b/DESCRIPTION
@@ -2,7 +2,7 @@ Package: roahd
 Type: Package
 Title: Robust Analysis of High Dimensional Data
 Version: 1.2
-Date: 2016-05-30
+Date: 2016-07-06
 Authors@R: c( person("Nicholas", "Tarabelloni", role = c("aut", "cre"),
                      email = "nicholas.tarabelloni@polimi.it"),
               person("Ana", "Arribas-Gil", role = "aut",
diff --git a/NEWS.md b/NEWS.md
@@ -10,4 +10,4 @@ Here's a list of what is changed in this update of __roahd__:
 
 2) Added the possibility to subset fData in time with logical vectors
 
-3) Fixes in methods BD, BD_relative, HI and EI
+3) Fixes in methods BD, BD_relative, HI and EI: the previous computational technique was based on arguments from the popular reference "Exact fast computation of band depth for large functional datasets: How quickly can one million curves be ranked?" by Sun, Genton and Nychka, which in the case of BD, and HI/EI are wrong. Now the implementation exploited sticks to the definition, at the cost of a higher computational burden (and thus, time to complete the computation).

Original file line number	Diff line number	Diff line change
`@@ -10,4 +10,4 @@ Here's a list of what is changed in this update of __roahd__:`
`10`	`10`
`11`	`11`	`2) Added the possibility to subset fData in time with logical vectors`
`12`	`12`
`13`		`-3) Fixes in methods BD, BD_relative, HI and EI`
	`13`	`+3) Fixes in methods BD, BD_relative, HI and EI: the previous computational technique was based on arguments from the popular reference "Exact fast computation of band depth for large functional datasets: How quickly can one million curves be ranked?" by Sun, Genton and Nychka, which in the case of BD, and HI/EI are wrong. Now the implementation exploited sticks to the definition, at the cost of a higher computational burden (and thus, time to complete the computation).`