droy homepage > curriculum vitæ
Last updated: Fall 2007
| name | daniel roy |
| droy (at) mit (dot) edu | |
| phone | 617 872 3267 |
Massachusetts Institute of Technology Cambridge, MA
Doctoral Candidate in Electrical Engineering and Computer
Science.
Master of Engineering in Electrical Engineering and Computer
Science (2006)
Bachelor of Science in Electrical Engineering and Computer
Science (2004)
GPA: 5.0 out of 5.0
Teaching Assistant, Inference and Information Spring 2008
with Prof. Polina Goland and Prof. Gregory Wornell. Gave recitations, office hours and designed exam and homework problems.
Teaching Assistant, Machine Learning Fall 2007
with Prof. Tommi Jaakkola. Gave weekly recitations, office hours, and designed homework problems.
Visiting Student, Gatsby Computational Neuroscience Unit, University College London Summer 2007
Collaborated with Prof. Yee Whye Teh on research related to combinatorial stochastic processes.
Research Assistant 2004 - Present
Conducting research on probabilistic A.I. and machine learning with advisor Leslie Kaelbling, as well as Joshua Tenenbaum (see Publications).
Research Assistant 2003 - 2004
Studied failure-oblivious computing and specification-assisted error localization and correction with Prof. Martin Rinard (see Publications).
Teaching Assistant, Computer Language Engineering Fall 2003
with Prof. Martin Rinard. Mentored undergraduate students as they designed a compiler from scratch, and designed exams and homework problems.
Resident Tutor, Leverett House, Harvard University 2007 - Present
under housemasters Prof. Howard Georgi and Ann Georgi. Sophomore advisor in computer science, mathematics and engineering. Intramural sports coordinator.
Amihot.com, Inc. Founder and
CTO
Founded in 2000, Amihot.com became an active community with ten thousand
unique visitors a day at the height of its popularity. I took the spring
term of my sophomore year off to work full-time on Amihot.com and make it
profitable. Amihot.com became profitable that spring, selling advertisement
as well as Amihot.com's own dating service, Amihot Extra.
Amihot's code exceeded 50,000 lines and
spaned three servers. As CTO, I wrote all of Amihot's code and worked
closely with our president and business director to further develop our
company. In 2004, I sold Amihot.com to HotOrNot.com.
Microsoft, Inc. Summer Internship 2001
Software Engineering Intern: Developed a remote
debugging tool for .NET development in the Office development
group. Worked with product managers, other developers to devise
specifications for and then develop the debug tool.
Xircom, Inc. (now Intel) Summer
Internships 1999, 2000
Software Engineering Intern: Developed
ActiveX COM objects (in C++ and Visual Basic). Proposed, developed and
implemented an XML protocol for Internet data exchange. Developed
synchronization software for a Palm-like device. Reworked an important
configuration utility to support new features and operating system using
Visual C++ and MFC. Developed an intranet using ASP and VBA to access a
back-end MS Access database.
Novalogic, Inc. Summer
Interships 1996, 1997
Quality Assurance Tester: Tested computer
games for quality assurance, reporting bugs into a bug database.
Computable exchangeable sequences have computable de Finetti measures,
with Cameron Freer.
To appear in
Proceedings of Computability in Europe (CiE 2009).
Preprint available upon request.
Exact and Approximate Sampling by Systematic Stochastic Search,
Vikash Mansinghka,
Daniel M. Roy,
Eric Jonas,
and
Joshua Tenenbaum.
To appear at AISTATS 2009.
The Mondrian Process,
with Yee Whye Teh.
In
Advances in Neural Information Processing Systems (NIPS*2008) 21, 2009.
A stochastic programming perspective on nonparametric Bayes,
Daniel M. Roy,
Vikash Mansinghka,
Noah Goodman,
and
Joshua Tenenbaum.
Nonparametric Bayesian Workshop at ICML, Helsinki, Finland, 2008.
Church: a language for generative models,
Noah Goodman,
Vikash Mansinghka,
Daniel M. Roy,
Keith Bonawitz,
and
Joshua Tenenbaum.
In
Uncertainty in Artificial Intelligence (UAI), 2008.
Bayesian Agglomerative Clustering with Coalescents
Yee Whye Teh,
Hal Daumé III,
and
Daniel M. Roy.
In
Advances in Neural Information Processing Systems (NIPS) 20.
Discovering Syntactic Hierarchies
Virginia Savova,
Daniel M. Roy,
Lauren Schmidt
and
Joshua B. Tenenbaum.
In Cognitive Science, 2007.
Learning Annotated Hierarchies from
Relational Data
Daniel M. Roy,
Charles Kemp,
Vikash Mansinghka,
and
Joshua B. Tenenbaum.
In
Advances in Neural Information Processing Systems (NIPS) 19.
Efficient B
ayesian Task-level Transfer Learning
[PS]
Daniel M. Roy and
Leslie P. Kaelbling
In
Proceedings of the International Joint Conference on Artificial Intelligience (IJCAI). Hyderabad, India. January, 2007.
Clustered Naive Bayes
[PS]
Daniel M. Roy
MEng thesis, Massachusetts Institute of Technology, 2006.
Enhancing Server Availability and Security Through Failure-Oblivious Computing
[PS]
Martin Rinard, Cristian Cadar,
Daniel Dumitran, Daniel M. Roy,
Tudor Leu, and William S. Beebee, Jr.
Proceedings of the 6th Symposium on Operating Systems Design and Implementation
San Francisco, CA December 2004
A Dynamic Technique for Eliminating Buffer Overflow Vulnerabilities (and Other Memory Errors)
[PS]
Martin Rinard, Cristian Cadar,
Daniel Dumitran, Daniel M. Roy,
and Tudor Leu
Proceedings of the 2004 Annual Computer Security Applications Conference
Tucson, AZ December 2004
Efficient Specification-Assisted Error Localization
[PS]
Brian Demsky, Cristian Cadar, Daniel M. Roy, and Martin C. Rinard
Proceedings of the Second International Workshop on Dynamic Analysis
Edinburgh, Scotland May 2004
Efficient Specification-Assisted Error Localization and Correction
[PS]
Brian Demsky, Cristian Cadar, Daniel M. Roy, and Martin C. Rinard
MIT CSAIL Technical Report 927
November 2003
Implementation of Constraint Systems for Useless Variable Elimination
[PS]
Daniel M. Roy, Mitchell Wand
August 1998
National Science Foundation (NSF) Graduate Research Fellowship
Three year fellowship granted to support PhD work at MIT.
Siebel Scholar
2003-04
"The Siebel Scholars program honors five
outstanding graduate students each year at the world's most prestigious
business and computer science schools."
Semi-finalist: Intel Science
Talent Search
Awarded for paper titled, Implementation of
Constraint Systems for Useless Variable Elimination. (1999)
Research Science
Institute (RSI)
An intense, six week, full-scholarship program held at MIT during
which 80 high-school students from around the world conduct research
under the supervision of university professors. (1998)
Semi-finalist: Lucent
Global Science Scholars
Awarded for paper titled, Implementation of
Constraint Systems for Useless Variable Elimination. (1999)
3rd Year Design Project Prize, Cambridge University, England
6.035 Optimizing Compiler Competition - 1st place
Fastest optimizing compiler for a subset of Java.
Emerson Music Scholarship (2006)
Emerson Music Scholarship (2007)
Competitive scholarship awarded for private study of Cello.
Ragnar and Margaret Naess Award (2008)
In recognition of exceptional talent and commitment to performance and private study of the cello as an Emerson String Scholar.
Operating Systems OS X, Linux
Text Editor vi(m)
Typesetting latex
Keyboard dvorak
Trackpad tap to click
Languages Church/Scheme, Mathematica, MATLAB, C
Programming Philosophy Prototype then refactor, only if necessary
Studied classical cello for 13+2 years. MIT Symphony Orchestra (2006), MIT Chamber Music Society (2006, 2007, 2008). Captain of Cambridge University Volleyball Club (BUSA/EVA Champions, 2001). Member of MIT's Men's Varsity Volleyball Team (2000,2003). Member of Zeta Beta Tau Fraternity.
Available upon request.