Quasi-Monte-Carlo methods and the dispersion of point sequences
暂无分享,去创建一个
[1] Harald Niederreiter,et al. Implementation and tests of low-discrepancy sequences , 1992, TOMC.
[2] János Komlós,et al. Almost tight bounds forɛ-Nets , 1992, Discret. Comput. Geom..
[3] Jirí Matousek,et al. Discrepancy and approximations for bounded VC-dimension , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[4] H. Niederreiter. Low-discrepancy and low-dispersion sequences , 1988 .
[5] Paul Bratley,et al. Algorithm 659: Implementing Sobol's quasirandom sequence generator , 1988, TOMS.
[6] H. Niederreiter. Point sets and sequences with small discrepancy , 1987 .
[7] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[8] I. Bárány,et al. Empty Simplices in Euclidean Space , 1987, Canadian Mathematical Bulletin.
[9] John Hershberger,et al. Finding the visibility graph of a simple polygon in time proportional to its size , 1987, SCG '87.
[10] Bennett L. Fox,et al. Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators , 1986, TOMS.
[11] G. Larcher. The dispersion of a special sequence , 1986 .
[12] H. Niederreiter,et al. Localization of Search in Quasi-Monte Carlo Methods for Global Optimization , 1986 .
[13] G. Larcher. Über die isotrope Diskrepanz von Folgen , 1986 .
[14] William W. L. Chen. On irregularities of distribution. , 1980 .
[15] Jon Louis Bentley,et al. Multidimensional binary search trees used for associative searching , 1975, CACM.
[16] J. Boothroyd,et al. Algorithm 246: Graycode , 1964, CACM.
[17] E. Hlawka. Zur angenäherten Berechnung mehrfacher Integrale , 1962 .
[18] E. Hlawka. Funktionen von beschränkter Variatiou in der Theorie der Gleichverteilung , 1961 .
[19] J. Halton. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , 1960 .
[20] R. Tichy. Spherical Dispersion with an Application to Polygonal Approximation of Curves , 1995 .
[21] Harald Niederreiter,et al. Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.
[22] J. Komlos,et al. Almost tight bounds for $\epsilon$-nets , 1992 .
[23] P. Gruber,et al. Funktionen von beschränkter Variation in der Theorie der Gleichverteilung , 1990 .
[24] R. Tichy,et al. C-Uniform Distribution on Compact Metric Spaces , 1988 .
[25] Harald Niederreiter,et al. Quasi-Monte Carlo Methods for Global Optimization , 1985 .
[26] Georg Ch. Pflug,et al. Mathematical statistics and applications , 1985 .
[27] H. Niederreiter,et al. A quasi-Monte Carlo method for the approximate computation of the extreme values of a function , 1983 .
[28] P. Erdos,et al. Studies in Pure Mathematics , 1983 .
[29] H. Faure. Discrépance de suites associées à un système de numération (en dimension s) , 1982 .
[30] Lauwerens Kuipers,et al. Uniform distribution of sequences , 1974 .
[31] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[32] I. Sobol. On the distribution of points in a cube and the approximate evaluation of integrals , 1967 .
[33] L. Tóth. Lagerungen in der Ebene auf der Kugel und im Raum , 1953 .