fixed firsts comments from frankd

This commit is contained in:
toni
2018-02-24 13:10:46 +01:00
parent 96b1840f1b
commit 46c8bc4b1c
5 changed files with 22 additions and 22 deletions

View File

@@ -2,7 +2,7 @@
Within this paper a novel approach for rapid computation of the KDE was presented.
This is achieved by considering the discrete convolution structure of the BKDE and thus elaborate its connection to digital signal processing, especially the Gaussian filter.
Using a box filter as an appropriate approximation results in an efficient computation scheme with a fully linear complexity \landau{N} and a negligible overhead, as confirmed by the utilized experiments.
Using a box filter as an appropriate approximation results in an efficient computation scheme with a fully linear complexity and a negligible overhead, as confirmed by the utilized experiments.
The analysis of the error showed that the method exhibits an expected error behaviour compared to the BKDE.
In terms of calculation time, our approach outperforms other state of the art implementations.