Near-optimal sensor placements in Gaussian processes
暂无分享,去创建一个
[1] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[2] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[3] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[4] Alan J. Miller,et al. A review of some exchange algorithms for constructing discrete D-optimal designs , 1992 .
[5] Robert Haining,et al. Statistics for spatial data: by Noel Cressie, 1991, John Wiley & Sons, New York, 900 p., ISBN 0-471-84336-9, US $89.95 , 1993 .
[6] Maurice Queyranne,et al. An Exact Algorithm for Maximum Entropy Sampling , 1995, Oper. Res..
[7] A. Storkey. Truncated covariance matrices and Toeplitz methods in Gaussian processes , 1999 .
[8] Richard J. Beckman,et al. A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.
[9] Héctor H. González-Baños,et al. A randomized art-gallery algorithm for sensor placement , 2001, SCG '01.
[10] Christopher J. Paciorek,et al. Nonstationary Gaussian Processes for Regression and Spatial Modelling , 2003 .
[11] Wei Hong,et al. Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.
[12] David J. C. MacKay,et al. Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.
[13] Carlos Guestrin,et al. A Note on the Budgeted Maximization of Submodular Functions , 2005 .
[14] Chris Bailey-Kellogg,et al. Gaussian Processes for Active Data Mining of Spatial Aggregates , 2005, SDM.