Using parallelization with twenty threads, our implementation achieves an average of 4.8ms per value retrieval.
in a Gaussian kernel K h , more than 99% of the area beneath the curve is within a 3h-radius from the center.