University of Cambridge, Department of Engineering
List of publications from the DBLP Bibliography Server - FAQ| 2013 | ||
|---|---|---|
| i5 | Balaji Lakshminarayanan, Daniel M. Roy, Yee Whye Teh: Top-down particle filtering for Bayesian decision trees. CoRR abs/1303.0561 (2013) | |
| 2012 | ||
| j4 | Cameron E. Freer, Daniel M. Roy: Computable de Finetti measures. Ann. Pure Appl. Logic 163(5): 530-546 (2012) | |
| c13 | James Robert Lloyd, Peter Orbanz, Zoubin Ghahramani, Daniel M. Roy: Random function priors for exchangeable arrays with applications to graphs and relational data. NIPS 2012: 1007-1015 | |
| i4 | David Wingate, Noah D. Goodman, Daniel M. Roy, Joshua B. Tenenbaum: The Infinite Latent Events Model. CoRR abs/1205.2604 (2012) | |
| i3 | Noah D. Goodman, Vikash K. Mansinghka, Daniel M. Roy, Keith Bonawitz, Daniel Tarlow: Church: a language for generative models. CoRR abs/1206.3255 (2012) | |
| i2 | Cameron E. Freer, Daniel M. Roy, Joshua B. Tenenbaum: Towards common-sense reasoning via conditional simulation: legacies of Turing in Artificial Intelligence. CoRR abs/1212.4799 (2012) | |
| 2011 | ||
| c12 | David Wingate, Noah D. Goodman, Daniel M. Roy, Leslie Pack Kaelbling, Joshua B. Tenenbaum: Bayesian Policy Search with Policy Priors. IJCAI 2011: 1565-1570 | |
| c11 | Nathanael Leedom Ackerman, Cameron E. Freer, Daniel M. Roy: Noncomputable Conditional Distributions. LICS 2011: 107-116 | |
| c10 | Sasa Misailovic, Daniel M. Roy, Martin C. Rinard: Probabilistically Accurate Program Transformations. SAS 2011: 316-333 | |
| 2010 | ||
| j3 | Cameron E. Freer, Daniel M. Roy: Posterior distributions are computable from predictive distributions. Journal of Machine Learning Research - Proceedings Track 9: 233-240 (2010) | |
| 2009 | ||
| j2 | Vikash K. Mansinghka, Daniel M. Roy, Eric Jonas, Joshua B. Tenenbaum: Exact and Approximate Sampling by Systematic Stochastic Search. Journal of Machine Learning Research - Proceedings Track 5: 400-407 (2009) | |
| c9 | Cameron E. Freer, Daniel M. Roy: Computable Exchangeable Sequences Have Computable de Finetti Measures. CiE 2009: 218-231 | |
| c8 | David Wingate, Noah D. Goodman, Daniel M. Roy, Joshua B. Tenenbaum: The Infinite Latent Events Model. UAI 2009: 607-614 | |
| i1 | ||
| 2008 | ||
| c7 | ||
| c6 | Noah D. Goodman, Vikash K. Mansinghka, Daniel M. Roy, Keith Bonawitz, Joshua B. Tenenbaum: Church: a language for generative models. UAI 2008: 220-229 | |
| 2007 | ||
| j1 | Vikash K. Mansinghka, Daniel M. Roy, Ryan Rifkin, Joshua B. Tenenbaum: AClass: A simple, online, parallelizable algorithm for probabilistic classification. Journal of Machine Learning Research - Proceedings Track 2: 315-322 (2007) | |
| c5 | Daniel M. Roy, Leslie Pack Kaelbling: Efficient Bayesian Task-Level Transfer Learning. IJCAI 2007: 2599-2604 | |
| c4 | Yee Whye Teh, Hal Daumé III, Daniel M. Roy: Bayesian Agglomerative Clustering with Coalescents. NIPS 2007 | |
| 2006 | ||
| c3 | Daniel M. Roy, Charles Kemp, Vikash K. Mansinghka, Joshua B. Tenenbaum: Learning annotated hierarchies from relational data. NIPS 2006: 1185-1192 | |
| 2004 | ||
| c2 | Martin C. Rinard, Cristian Cadar, Daniel Dumitran, Daniel M. Roy, Tudor Leu: A Dynamic Technique for Eliminating Buffer Overflow Vulnerabilities (and Other Memory Errors). ACSAC 2004: 82-90 | |
| c1 | Martin C. Rinard, Cristian Cadar, Daniel Dumitran, Daniel M. Roy, Tudor Leu, William S. Beebee: Enhancing Server Availability and Security Through Failure-Oblivious Computing. OSDI 2004: 303-316 | |
| 1999 | ||
| b1 | Loïc Briand, Daniel M. Roy: Meeting deadlines in hard real-time systems - the rate monotonic approach. IEEE 1999, isbn 978-0-8186-7406-8, pp. I-XVI, 1-253 | |
Colors in the list of coauthors
Last update Sat May 25 14:27:52 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page