FHWS/Fusion2018
Archived
4
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

fixed firsts comments from frankd

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

2
tex/chapters/relatedwork.tex
View File

@@ -29,7 +29,7 @@ These algorithms reduce the number of evaluated kernels by taking the the spatia
% fast multipole method & Fast Gaus Transform
Another approach is to reduce the algorithmic complexity of the sum over Gaussian functions, by employing a specialized variant of the fast multipole method.
The term fast Gauss transform was coined by Greengard \cite{greengard1991fast} who suggested this approach to reduce the complexity of the KDE to \label{N+M}.
The term fast Gauss transform was coined by Greengard \cite{greengard1991fast} who suggested this approach to reduce the complexity of the KDE to \landau{N+M}.
% However, the complexity grows exponentially with dimension. \cite{Improved Fast Gauss Transform and Efficient Kernel Density Estimation}
% FastKDE, passed on ECF and nuFFT