Optimizing sensing: theory and applications
暂无分享,去创建一个
[1] Sean R Eddy,et al. What is dynamic programming? , 2004, Nature Biotechnology.
[2] Uri Lerner,et al. Inference in Hybrid Networks: Theoretical Limits and Practical Algorithms , 2001, UAI.
[3] Andreas Krause,et al. Intelligent light control using sensor networks , 2005, SenSys '05.
[4] Xavier Boyen,et al. Tractable Inference for Complex Stochastic Processes , 1998, UAI.
[5] Dong Xuan,et al. On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.
[6] Alfred Stein,et al. Constrained Optimization of Spatial Sampling using Continuous Simulated Annealing , 1998 .
[7] M. Stealey,et al. High Resolution River Hydraulic and Water Quality Characterization Using Rapidly Deployable Networked Infomechanical Systems (NIMS RD) , 2007 .
[8] Christos Faloutsos,et al. Cascading Behavior in Large Blog Graphs , 2007 .
[9] Nicholas Roy,et al. Efficient Optimization of Information-Theoretic Exploration in SLAM , 2008, AAAI.
[10] H. Robbins. Some aspects of the sequential design of experiments , 1952 .
[11] David J. C. MacKay,et al. Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.
[12] Deborah Estrin,et al. Statistical model of lossy links in wireless sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..
[13] Stavros Toumpis,et al. Optimal placement of nodes in large sensor networks under a general physical layer model , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..
[14] Andreas Krause,et al. Optimizing Sensor Placements in Water Distribution Systems Using Submodular Function Maximization , 2008 .
[15] Pravin Varaiya,et al. Wireless magnetic sensors for traffic surveillance , 2008 .
[16] M. Stein. Nonstationary spatial covariance functions , 2005 .
[17] Noel A Cressie,et al. Statistics for Spatial Data. , 1992 .
[18] Amin Saberi,et al. An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.
[19] Wei Hong,et al. Model-Driven Data Acquisition in Sensor Networks , 2004, VLDB.
[20] Avi Ostfeld,et al. The Battle of the Water Sensor Networks (BWSN): A Design Challenge for Engineers and Algorithms , 2008 .
[21] Neil D. Lawrence,et al. Fast Forward Selection to Speed Up Sparse Gaussian Process Regression , 2003, AISTATS.
[22] E. Minieka. The m-Center Problem , 1970 .
[23] Andreas Krause,et al. Toward Community Sensing , 2008, 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008).
[24] R A Cooper,et al. Performance of selected lightweight wheelchairs on ANSI/RESNA tests. American National Standards Institute-Rehabilitation Engineering and Assistive Technology Society of North America. , 1997, Archives of physical medicine and rehabilitation.
[25] A. Darwiche,et al. Complexity Results and Approximation Strategies for MAP Explanations , 2011, J. Artif. Intell. Res..
[26] Sanjoy Dasgupta,et al. Analysis of a greedy active learning strategy , 2004, NIPS.
[27] L. Wolsey. Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems , 1982, Math. Oper. Res..
[28] Sanjoy Dasgupta,et al. Coarse sample complexity bounds for active learning , 2005, NIPS.
[29] H. Hotelling. Relations Between Two Sets of Variates , 1936 .
[30] Rong Jin,et al. Batch mode active learning and its application to medical image classification , 2006, ICML.
[31] H. Wynn,et al. Maximum entropy sampling and optimal Bayesian experimental design , 2000 .
[32] Matthew Richardson,et al. Mining knowledge-sharing sites for viral marketing , 2002, KDD.
[33] Gaurav S. Sukhatme,et al. Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .
[34] Jonathan W. Berry,et al. A FACILITY LOCATION APPROACH TO SENSOR PLACEMENT OPTIMIZATION , 2008 .
[35] Trevor Hastie,et al. The Elements of Statistical Learning , 2001 .
[36] D. V. Gokhale,et al. A Survey of Statistical Design and Linear Models. , 1976 .
[37] Alexander Grey,et al. The Mathematical Theory of Infectious Diseases and Its Applications , 1977 .
[38] Andreas Krause,et al. Nonmyopic Informative Path Planning in Spatio-Temporal Models , 2007, AAAI.
[39] Ronald E. Parr,et al. Non-Myopic Multi-Aspect Sensing with Partially Observable Markov Decision Processes , 2005 .
[40] Dale L. Zimmerman,et al. Optimal network design for spatial prediction, covariance parameter estimation, and empirical prediction , 2006 .
[41] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[42] W. J. Studden,et al. Theory Of Optimal Experiments , 1972 .
[43] Ashish Goel,et al. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.
[44] Gilbert Laporte,et al. The selective travelling salesman problem , 1990, Discret. Appl. Math..
[45] W. Dunsmuir,et al. Estimation of nonstationary spatial covariance structure , 2002 .
[46] Chandra Chekuri,et al. Improved algorithms for orienteering and related problems , 2008, SODA '08.
[47] Wolfram Burgard,et al. Information Gain-based Exploration Using Rao-Blackwellized Particle Filters , 2005, Robotics: Science and Systems.
[48] David R. Karger,et al. Approximation algorithms for orienteering and discounted-reward TSP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[49] Zoran Kapelan,et al. An Efficient Algorithm for Sensor Placement in Water Distribution Systems , 2008 .
[50] John F. Canny,et al. A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[51] Ting Sun,et al. Single-pixel imaging via compressive sampling , 2008, IEEE Signal Process. Mag..
[52] Chandra Chekuri,et al. A recursive greedy algorithm for walks in directed graphs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[53] M. Scherer. User desires for wheelchairs. RERC-TET study shows manufacturers would do well to listen to consumers. Rehabilitation Engineering Research Center on Technology Evaluation and Transfer. , 1996, Rehab management.
[54] Neil D. Lawrence,et al. Fast Sparse Gaussian Process Methods: The Informative Vector Machine , 2002, NIPS.
[55] R. Tibshirani. Regression Shrinkage and Selection via the Lasso , 1996 .
[56] R. D. Cook,et al. A Comparison of Algorithms for Constructing Exact D-Optimal Designs , 1980 .
[57] B. Mallick,et al. Analyzing Nonstationary Spatial Data Using Piecewise Gaussian Processes , 2005 .
[58] S. Luttrell. The use of transinformation in the design of data sampling schemes for inverse problems , 1985 .
[59] E.J. Candes,et al. An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.
[60] R. Kass,et al. Shrinkage Estimators for Covariance Matrices , 2001, Biometrics.
[61] Daphne Koller,et al. Active Learning for Parameter Estimation in Bayesian Networks , 2000, NIPS.
[62] Melvyn Sim,et al. Robust discrete optimization and network flows , 2003, Math. Program..
[63] L. Baum,et al. Statistical Inference for Probabilistic Functions of Finite State Markov Chains , 1966 .
[64] H. B. McMahan,et al. Robust Submodular Observation Selection , 2008 .
[65] Jacques F. Benders,et al. Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..
[66] Shai Avidan,et al. Spectral Bounds for Sparse PCA: Exact and Greedy Algorithms , 2005, NIPS.
[67] Ravi Kumar,et al. On the Bursty Evolution of Blogspace , 2003, WWW '03.
[68] Sollich. Learning from minimum entropy queries in a large committee machine. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.
[69] Anthony C. Atkinson,et al. Recent Developments in the Methods of Optimum and Related Experimental Designs , 1988 .
[70] Maurice Queyranne,et al. A combinatorial algorithm for minimizing symmetric submodular functions , 1995, SODA '95.
[71] Emre Ertin,et al. Gaussian Process Models for Censored Sensor Readings , 2007, 2007 IEEE/SP 14th Workshop on Statistical Signal Processing.
[72] Henry P. Wynn,et al. Maximum entropy sampling , 1987 .
[73] K. Chaloner,et al. Bayesian Experimental Design: A Review , 1995 .
[74] W. F. Caselton,et al. Optimal monitoring network designs , 1984 .
[75] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[76] Miodrag Potkonjak,et al. Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).
[77] Jan Vondrák,et al. Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.
[78] Jeff A. Bilmes,et al. A Submodular-supermodular Procedure with Applications to Discriminative Structure Learning , 2005, UAI.
[79] Samir Khuller,et al. Energy Efficient Monitoring in Sensor Networks , 2008, LATIN.
[80] D Cohen. An objective measure of seat comfort. , 1998, Aviation, space, and environmental medicine.
[81] John Langford,et al. Agnostic active learning , 2006, J. Comput. Syst. Sci..
[82] Andreas Krause,et al. Efficient Sensor Placement Optimization for Securing Large Water Distribution Networks , 2008 .
[83] Miodrag Potkonjak,et al. Sleeping Coordination for Comprehensive Sensing Using Isotonic Regression and Domatic Partitions , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[84] Zoubin Ghahramani,et al. Sparse Gaussian Processes using Pseudo-inputs , 2005, NIPS.
[85] S. Bikhchandani,et al. You have printed the following article : A Theory of Fads , Fashion , Custom , and Cultural Change as Informational Cascades , 2007 .
[86] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[87] D. Lindley. On a Measure of the Information Provided by an Experiment , 1956 .
[88] Pierre Hansen,et al. Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search , 2000, Networks.
[89] Boris Goldengorin,et al. The maximization of submodular functions , 1999 .
[90] Andrew McCallum,et al. Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data , 2001, ICML.
[91] M. de Looze,et al. Please Scroll down for Article Ergonomics Sitting Comfort and Discomfort and the Relationships with Objective Measures Sitting Comfort and Discomfort and the Relationships with Objective Measures , 2022 .
[92] Azriel Rosenfeld,et al. Sequential Operations in Digital Picture Processing , 1966, JACM.
[93] Aaron Archer. Inapproximability of the Asymmetric Facility Location and k-Median Problems , 2000 .
[94] D. Berlowitz,et al. Pressure Ulcers in the Nursing Home , 1993 .
[95] William F. Caselton,et al. Hydrologic Networks: Information Transmission , 1980 .
[96] Andreas Krause,et al. Nonmyopic active learning of Gaussian processes: an exploration-exploitation approach , 2007, ICML '07.
[97] Sudipto Guha,et al. Improved Combinatorial Algorithms for Facility Location Problems , 2005, SIAM J. Comput..
[98] William E. Hart,et al. FORMULATION AND OPTIMIZATION OF ROBUST SENSOR PLACEMENT PROBLEMS FOR CONTAMINANT WARNING SYSTEMS , 2008 .
[99] R. Deyo,et al. The effectiveness of four interventions for the prevention of low back pain. , 1994, JAMA.
[100] J. Zidek,et al. Designing and integrating composite networks for monitoring multivariate gaussian pollution fields , 2000 .
[101] Samir Khuller,et al. The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..
[102] László Lovász,et al. Submodular functions and convexity , 1982, ISMP.
[103] Toshihiro Fujito,et al. Approximation algorithms for submodular set cover with applications , 2000 .
[104] Barbara M. Anthony,et al. A plant location guide for the unsure , 2008, SODA '08.
[105] M. Stein,et al. Spatial sampling design for prediction with estimated parameters , 2006 .
[106] Alessandro Vespignani,et al. Immunization of complex networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.
[107] Shie Mannor,et al. Robust Regression and Lasso , 2008, IEEE Transactions on Information Theory.
[108] Leslie Ann Goldberg,et al. COUNTING UNLABELLED SUBTREES OF A TREE IS #P-COMPLETE , 2000 .
[109] Wolfgang Maass,et al. Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.
[110] Daphne Koller. Structured Probabilistic Models: Bayesian Networks and Beyond , 1998, AAAI/IAAI.
[111] L. Lipsitz,et al. A Longitudinal Study of Risk Factors Associated with the Formation of Pressure Ulcers in Nursing Homes , 1994, Journal of the American Geriatrics Society.
[112] Vijay S. Mookerjee,et al. Sequential Decision Models for Expert System Optimization , 1997, IEEE Trans. Knowl. Data Eng..
[113] Liam Paninski,et al. Asymptotic Theory of Information-Theoretic Experimental Design , 2005, Neural Computation.
[114] Naveen Garg,et al. Saving an epsilon: a 2-approximation for the k-MST problem in graphs , 2005, STOC '05.
[115] Vijay V. Vazirani,et al. Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs , 1999, SIAM J. Comput..
[116] David L Donoho,et al. Compressed sensing , 2006, IEEE Transactions on Information Theory.
[117] Colin G. Drury,et al. Identifying Factors of Comfort and Discomfort in Sitting , 1996, Hum. Factors.
[118] Lluís A. Belanche Muñoz,et al. Feature selection algorithms: a survey and experimental evaluation , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[119] Naftali Tishby,et al. The Information Of Observations And Application For Active Learning With Uncertainty , 2001 .
[120] Mihalis Yannakakis,et al. On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[121] Christopher J. Paciorek,et al. Nonstationary Gaussian Processes for Regression and Spatial Modelling , 2003 .
[122] Michael H. Bowling,et al. Computing Robust Counter-Strategies , 2007, NIPS.
[123] Harvey J. Greenberg,et al. Digital Object Identifier (DOI) 10.1007/s10107-005-0689-x , 2005 .
[124] Gruia Calinescu,et al. The Polymatroid Steiner Problems , 2005, J. Comb. Optim..
[125] Andreas Krause,et al. A Utility-Theoretic Approach to Privacy and Personalization , 2008, AAAI.
[126] Finn Verner Jensen,et al. Myopic Value of Information in Influence Diagrams , 1997, UAI.
[127] Vahab S. Mirrokni,et al. Maximizing Non-Monotone Submodular Functions , 2011, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[128] W. Welch. Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria , 1982 .
[129] A. Storkey. Truncated covariance matrices and Toeplitz methods in Gaussian processes , 1999 .
[130] R. Kershner. The Number of Circles Covering a Set , 1939 .
[131] Himanshu Gupta,et al. Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.
[132] T. J. Mitchell,et al. Bayesian Prediction of Deterministic Functions, with Applications to the Design and Analysis of Computer Experiments , 1991 .
[133] D. Wiens. Robustness in spatial studies II: minimax design , 2005 .
[134] Andreas Krause,et al. Optimal Nonmyopic Value of Information in Graphical Models - Efficient Algorithms and Theoretical Limits , 2005, IJCAI.
[135] Vladimir Vapnik,et al. The Nature of Statistical Learning , 1995 .
[136] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[137] Jason Weston,et al. Gene Selection for Cancer Classification using Support Vector Machines , 2002, Machine Learning.
[138] A. Gionis,et al. Models and Algorithms for Network Immunization , 2005 .
[139] David J. C. MacKay,et al. Information-Based Objective Functions for Active Data Selection , 1992, Neural Computation.
[140] Héctor H. González-Baños,et al. A randomized art-gallery algorithm for sensor placement , 2001, SCG '01.
[141] Peter D. Turney. Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm , 1994, J. Artif. Intell. Res..
[142] Jos F. Sturm,et al. A Matlab toolbox for optimization over symmetric cones , 1999 .
[143] J. Gittins,et al. A dynamic allocation index for the discounted multiarmed bandit problem , 1979 .
[144] Laurence A. Wolsey,et al. An analysis of the greedy algorithm for the submodular set covering problem , 1982, Comb..
[145] Ole Winther,et al. Efficient Approaches to Gaussian Process Classification , 1999, NIPS.
[146] Bardsley Gi. The Dundee seating programme. , 1984 .
[147] Michael L. Littman,et al. The Computational Complexity of Probabilistic Planning , 1998, J. Artif. Intell. Res..
[148] R. Webster,et al. Optimal interpolation and isarithmic mapping of soil properties. II. Block kriging. , 1980 .
[149] David A. Cohn,et al. Active Learning with Statistical Models , 1996, NIPS.
[150] Alan J. Miller,et al. A review of some exchange algorithms for constructing discrete D-optimal designs , 1992 .
[151] D M Brienza,et al. Seat cushion design for elderly wheelchair users based on minimization of soft tissue deformation using stiffness and pressure measurements. , 1996, IEEE transactions on rehabilitation engineering : a publication of the IEEE Engineering in Medicine and Biology Society.
[152] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .
[153] Matthew Hurst,et al. Deriving marketing intelligence from online discussion , 2005, KDD '05.
[154] S. Schwartz,et al. An accelerated sequential algorithm for producing D -optimal designs , 1989 .
[155] Igor Averbakh,et al. On the complexity of a class of combinatorial optimization problems with uncertainty , 2001, Math. Program..
[156] Volker Tresp,et al. Mixtures of Gaussian Processes , 2000, NIPS.
[157] David Higdon,et al. Non-Stationary Spatial Modeling , 2022, 2212.08043.
[158] John Zimmerman,et al. The SenseChair: the lounge chair as an intelligent assistive device for elders , 2005, DUX '05.
[159] Cynthia A. Phillips,et al. Sensor Placement in Municipal Water Networks with Temporal Integer Programming Models , 2006 .
[160] A. Atkinson. The Usefulness of Optimum Experimental Designs , 1996 .
[161] Amir Globerson,et al. Nightmare at test time: robust learning by feature deletion , 2006, ICML.
[162] Christopher K. I. Williams,et al. Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning) , 2005 .
[163] Suman Banerjee,et al. Node Placement for Connected Coverage in Sensor Networks , 2003 .
[164] C. Guestrin,et al. Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.
[165] Subhash Khot,et al. Approximation Algorithms for the Max-Min Allocation Problem , 2007, APPROX-RANDOM.
[166] Eric Horvitz,et al. Selective Supervision: Guiding Supervised Learning with Decision-Theoretic Active Learning , 2007, IJCAI.
[167] Maxim Sviridenko,et al. A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..
[168] Pedro M. Domingos,et al. On the Optimality of the Simple Bayesian Classifier under Zero-One Loss , 1997, Machine Learning.
[169] Feng Zhao,et al. Information-Driven Dynamic Sensor Collaboration for Tracking Applications , 2002 .
[170] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[171] Jacob Goldenberg,et al. Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .
[172] R. K. Meyer,et al. Constructing exact D-optimal experimental designs by simulated annealing , 1988 .
[173] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[174] William E. Hart,et al. Discrete sensor placement problems in distribution networks , 2005, Math. Comput. Model..
[175] Solomon Eyal Shimony,et al. Efficient Deterministic Approximation Algorithms for Non-myopic Value of Information in Graphical Models , 2006, 2006 IEEE International Conference on Systems, Man and Cybernetics.
[176] Carl E. Rasmussen,et al. Warped Gaussian Processes , 2003, NIPS.
[177] Matthias W. Seeger,et al. Gaussian Processes For Machine Learning , 2004, Int. J. Neural Syst..
[178] Rosalind W. Picard,et al. Towards a Learning Companion that Recognizes Affect , 2001 .
[179] Michel Minoux,et al. Accelerated greedy algorithms for maximizing submodular set functions , 1978 .
[180] Dudley,et al. Real Analysis and Probability: Measurability: Borel Isomorphism and Analytic Sets , 2002 .
[181] P. Guttorp,et al. Nonparametric Estimation of Nonstationary Spatial Covariance Structure , 1992 .
[182] Robert D. Nowak,et al. Faster Rates in Regression via Active Learning , 2005, NIPS.
[183] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[184] Ian H. Witten,et al. Data mining: practical machine learning tools and techniques with Java implementations , 2002, SGMD.
[185] F. Pukelsheim. Information increasing orderings in experimental design theory , 1987 .
[186] Y. Freund,et al. Discussion of the Paper \additive Logistic Regression: a Statistical View of Boosting" By , 2000 .
[187] Robert Price,et al. Optimal Recommendation Sets: Covering Uncertainty over User Preferences , 2005, AAAI.
[188] Alex Pentland,et al. A sensing chair using pressure distribution sensors , 2001 .
[189] Asaf Levin. A better approximation algorithm for the budget prize collecting tree problem , 2004, Oper. Res. Lett..
[190] Teofilo F. GONZALEZ,et al. Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..
[191] J. Bernardo. Expected Information as Expected Utility , 1979 .
[192] Sheng Chen,et al. Orthogonal least squares methods and their application to non-linear system identification , 1989 .
[193] Avi Ostfeld,et al. Optimal Layout of Early Warning Detection Stations for Water Distribution Systems Security , 2004 .
[194] Arthur H. Delmege,et al. Design-by-Computer , 1971 .
[195] Jinbo Bi,et al. Active learning via transductive experimental design , 2006, ICML.
[196] Hong Z. Tan,et al. Template-based Recognition of Static Sitting Postures , 2003, 2003 Conference on Computer Vision and Pattern Recognition Workshop.
[197] R. Bellman. A Markovian Decision Process , 1957 .
[198] Judit Bar-Ilan,et al. Generalized submodular cover problems and applications , 2001, Theor. Comput. Sci..
[199] Alexander Schrijver,et al. A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.
[200] Jure Leskovec,et al. The dynamics of viral marketing , 2005, EC '06.
[201] Clifford S. Stein. Estimation of a covariance matrix , 1975 .
[202] Robert B. Gramacy,et al. Bayesian treed gaussian process models , 2005 .
[203] M G Helander,et al. Field studies of comfort and discomfort in sitting. , 1997, Ergonomics.
[204] Andreas Krause,et al. Efficient Planning of Informative Paths for Multiple Robots , 2006, IJCAI.
[205] Olivier Ledoit,et al. A well-conditioned estimator for large-dimensional covariance matrices , 2004 .
[206] L. van der Gaag,et al. Selective evidence gathering for diagnostic belief networks , 1993 .
[207] Toby J. Mitchell,et al. An Algorithm for the Construction of “D-Optimal” Experimental Designs , 2000, Technometrics.
[208] Eric Horvitz,et al. An approximate nonmyopic computation for value of information , 1994, UAI 1994.
[209] David B. Shmoys,et al. A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..
[210] H. Sebastian Seung,et al. Selective Sampling Using the Query by Committee Algorithm , 1997, Machine Learning.
[211] David S. Johnson,et al. The prize collecting Steiner tree problem: theory and practice , 2000, SODA '00.
[212] Jeff A. Bilmes,et al. PAC-learning Bounded Tree-width Graphical Models , 2004, UAI.
[213] Ramanathan V. Guha,et al. Information diffusion through blogspace , 2004, WWW '04.
[214] Gene H. Golub,et al. Matrix computations , 1983 .
[215] Lewis A. Rossman,et al. The EPANET Programmer's Toolkit for Analysis of Water Distribution Systems , 1999 .
[216] J. R. Quinlan. Induction of decision trees , 2004, Machine Learning.
[217] D. Lindley,et al. Bayes Estimates for the Linear Model , 1972 .
[218] Ronald A. Howard,et al. Information Value Theory , 1966, IEEE Trans. Syst. Sci. Cybern..
[219] Carl E. Rasmussen,et al. Infinite Mixtures of Gaussian Process Experts , 2001, NIPS.
[220] Roberto Gueli. PREDATOR - PREY MODEL FOR DISCRETE SENSOR PLACEMENT , 2008 .
[221] Maurice Queyranne,et al. An Exact Algorithm for Maximum Entropy Sampling , 1995, Oper. Res..
[222] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .
[223] H.T. Friis,et al. A Note on a Simple Transmission Formula , 1946, Proceedings of the IRE.
[224] Andreas Krause,et al. Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..
[225] Satoru Iwata,et al. A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.
[226] Shai Avidan,et al. Generalized spectral bounds for sparse LDA , 2006, ICML.
[227] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[228] Andreas Krause,et al. Optimal Value of Information in Graphical Models , 2009, J. Artif. Intell. Res..
[229] Santosh S. Vempala,et al. New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen , 1999, SIAM J. Comput..
[230] Joelle Pineau,et al. Anytime Point-Based Approximations for Large POMDPs , 2006, J. Artif. Intell. Res..
[231] Satoru Fujishige,et al. Polymatroidal Dependence Structure of a Set of Random Variables , 1978, Inf. Control..
[232] Sean R. Eddy,et al. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids , 1998 .
[233] G. Nemhauser,et al. Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms* , 1981 .
[234] Abhimanyu Das,et al. Algorithms for subset selection in linear regression , 2008, STOC.
[235] John W. Fisher,et al. Performance Guarantees for Information Theoretic Active Inference , 2007, AISTATS.
[236] Sudipto Guha,et al. Asymmetric k-center is log* n-hard to approximate , 2005, JACM.
[237] Robert Krauthgamer,et al. Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[238] Nicholas Roy,et al. Global A-Optimal Robot Exploration in SLAM , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.
[239] Yoav Shoham,et al. Optimal Testing of Structured Knowledge , 2008, AAAI.
[240] N. Higham. Computing the nearest correlation matrix—a problem from finance , 2002 .
[241] Andrew W. Fitzgibbon,et al. Direct least squares fitting of ellipses , 1996, Proceedings of 13th International Conference on Pattern Recognition.
[242] Reuven Cohen,et al. Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.
[243] Eibe Frank,et al. Logistic Model Trees , 2003, ECML.
[244] Sanjoy Dasgupta,et al. A General Agnostic Active Learning Algorithm , 2007, ISAIM.
[245] Hovav A. Dror,et al. Robust Experimental Design for Multivariate Generalized Linear Models , 2006, Technometrics.
[246] Joel A. Tropp,et al. Greed is good: algorithmic results for sparse approximation , 2004, IEEE Transactions on Information Theory.
[247] A. O'Hagan,et al. Curve Fitting and Optimal Design for Prediction , 1978 .
[248] Stefan Wrobel,et al. Active Learning of Partially Hidden Markov Models , 2001 .
[249] Andreas Krause,et al. Robust, low-cost, non-intrusive sensing and recognition of seated postures , 2007, UIST.
[250] Chris Bailey-Kellogg,et al. Gaussian Processes for Active Data Mining of Spatial Aggregates , 2005, SDM.
[251] Lise Getoor,et al. VOILA: Efficient Feature-value Acquisition for Classification , 2007, AAAI.
[252] 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.
[253] Valentina Bayer-Zubek. Learning diagnostic policies from examples by systematic search , 2004, UAI 2004.
[254] A Gerodimos,et al. Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..
[255] Klaus Obermayer,et al. Gaussian Process Regression: Active Data Selection and Test Point Rejection , 2000, DAGM-Symposium.
[256] Michael I. Jordan,et al. Robust design of biological experiments , 2005, NIPS.
[257] Pramod K. Varshney,et al. Energy-efficient deployment of Intelligent Mobile sensor networks , 2005, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.