Daniel Golovin

Loading Google Thumbnails...
2011
15Dynamic Resource Allocation in Conservation Planning. Daniel Golovin, Andreas Krause, Beth Gardner, Sarah J. Converse, Steve Morey. AAAI 2011. Web SearchBibTeXDownload
14A revealed preference approach to computational complexity in economics. Federico Echenique, Daniel Golovin, Adam Wierman. ACM Conference on Electronic Commerce 2011, 101-110. Web SearchBibTeXDownload
13Adaptive Submodular Optimization under Matroid Constraints. Daniel Golovin, Andreas Krause. CoRR (abs/1101.4450) (2011). Web SearchBibTeXDownload
12Randomized Sensing in Adversarial Environments. Andreas Krause, Alex Roper, Daniel Golovin. IJCAI 2011, 2133-2139. Web SearchBibTeXDownload
11Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization. Daniel Golovin, Andreas Krause. J. Artif. Intell. Res. (JAIR) (42): 427-486 (2011). Web SearchBibTeXDownload
10Complexity and economics: computational constraints may not matter empirically. Federico Echenique, Daniel Golovin, Adam Wierman. SIGecom Exchanges (10): 2-5 (2011). Web SearchBibTeXDownload
2010
9Adaptive Submodularity: A New Approach to Active Learning and Stochastic Optimization. Daniel Golovin, Andreas Krause. CoRR (abs/1003.3967) (2010). Web SearchBibTeXDownload
8Near-Optimal Bayesian Active Learning with Noisy Observations. Daniel Golovin, Andreas Krause, Debajyoti Ray. CoRR (abs/1010.3091) (2010). Web SearchBibTeXDownload
7Online Distributed Sensor Selection. Daniel Golovin, Matthew Faulkner, Andreas Krause. CoRR (abs/1002.1782) (2010). Web SearchBibTeXDownload
6Online distributed sensor selection. Daniel Golovin, Matthew Faulkner, Andreas Krause. IPSN 2010, 220-231. Web SearchBibTeXDownload
2009
5Simultaneous source location. Konstantin Andreev, Charles Garrod, Daniel Golovin, Bruce M. Maggs, Adam Meyerson. ACM Transactions on Algorithms (6) (2009). Web SearchBibTeXDownload
4Online Learning of Assignments that Maximize Submodular Functions. Daniel Golovin, Andreas Krause, Matthew J. Streeter. CoRR (abs/0908.0772) (2009). Web SearchBibTeXDownload
3Online Learning of Assignments. Matthew J. Streeter, Daniel Golovin, Andreas Krause. NIPS 2009, 1794-1802. Web SearchBibTeXDownload
2008
2All-Norms and All-L_p-Norms Approximation Algorithms. Daniel Golovin, Anupam Gupta, Amit Kumar, Kanat Tangwongsan. FSTTCS 2008, 199-210. Web SearchBibTeXDownload
2006
1Quorum placement in networks: minimizing network congestion. Daniel Golovin, Anupam Gupta, Bruce M. Maggs, Florian Oprea, Michael K. Reiter. PODC 2006, 16-25. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research