what is the typical pattern for random sampling? one of the two listed ones?
WJM
(First just to reiterate what is said in the video it should be O(n**(-1/2)) not +1).
I noticed that given 2 dimensions the error of estimate functions are the same. In that case I wonder how the computation requirement of the two methods compare in a computer graphics environment.
EmDeeZee
Since the error is independent of the dimensionality of the integrand and dependent on the number of samples, does that mean that using, for example, 5 samples for a very short, small signal and 5 samples for a long, large signal will produce the same error?
what is the typical pattern for random sampling? one of the two listed ones?
(First just to reiterate what is said in the video it should be O(n**(-1/2)) not +1).
I noticed that given 2 dimensions the error of estimate functions are the same. In that case I wonder how the computation requirement of the two methods compare in a computer graphics environment.
Since the error is independent of the dimensionality of the integrand and dependent on the number of samples, does that mean that using, for example, 5 samples for a very short, small signal and 5 samples for a long, large signal will produce the same error?