Result 1 to 10 of 10 total
Computational investigations of scrambled Faure sequences. (English)
Math. Comput. Simul. 81, No. 3, 522-535 (2010).
1
On the convergence of quasi-random sampling/importance resampling. (English)
Math. Comput. Simul. 81, No. 3, 490-505 (2010).
2
A time-frequency technique for blind separation and localization of pure delayed sources. (English)
Vigneron, Vincent (ed.) et al., Latent variable analysis and signal separation. 9th international conference, LVA/ICA 2010, St. Malo, France, September 27‒30, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15994-7/pbk). Lecture Notes in Computer Science 6365, 546-554 (2010).
3
An adaptive approach to cube-based quasi-Monte Carlo integration on $\Bbb R^d$. (English)
Math. Comput. Simul. 80, No. 6, 1104-1117 (2010).
4
A time-frequency technique for blind separation and localization of pure delayed sources (English)
LVA/ICA, 546-554 (2010).
5
On obtaining higher order convergence for smooth periodic functions. (English)
J. Complexity 24, No. 3, 328-340 (2008).
6
On obtaining quadratic and cubic error convergence using weighted Kronecker-sequences. (English)
Computing 80, No. 1, 75-94 (2007).
7
Quasi-random integration in high dimensions. (English)
Math. Comput. Simul. 73, No. 5, 309-319 (2007).
8
Minimizing the $L_{2}$ and $L_{\infty}$ star discrepancies of a single point in the unit hypercube. (English)
J. Comput. Appl. Math. 197, No. 1, 282-285 (2006).
9
Good permutations for deterministic scrambled Halton sequences in terms of $L_2$-discrepancy. (English)
J. Comput. Appl. Math. 189, No. 1-2, 341-361 (2006).
10
Result 1 to 10 of 10 total
Start
Contact
Print
General Help
