Michael S. Gashler

Objectives

• I am currently working on a Ph.D. in machine learning at Brigham Young University. After that, I intend to seek a research position that will allow me to publish all discoveries that I make. I am particularly interested in agent systems that rely on learning, rather than hard-coded knowledge, to operate effectively in the real world.

Publications

• Gashler, Michael S. and Ventura, Dan and Martinez, Tony. Iterative non-linear dimensionality reduction with manifold sculpting. In Platt, J.C. and Koller, D. and Singer, Y. and Roweis, S., editor, Advances in Neural Information Processing Systems 20, pages 513–520, MIT Press, Cambridge, MA, 2008.

Work Experience

• Neural Networks and Machine Learning Lab	Did research for Tony Martinez in machine learning at Brigham Young University	May 2006 – Present
  Edumetrics Institute	Worked as a development lead and engineer to build an interpreter training program and a decentralized multiplayer Internet game.	Dec 2004 – May 2006
  Microsoft	Worked for Microsoft on the Common Language Runtime (the .NET virtual machine.) I developed Code Access Security and the PE file Verifier.	Jul 2001 – Nov 2004
  Vision Lab	Did Image processing research for Bill Barrett. I worked on finding object boundaries by matching similar parts of successive animation frames.	Jan 2001 – Jun 2001
  Microsoft	Internship for Microsoft. I did performance work on the startup time of Visual Studio 7.0.	May 2000 – Jul 2000
  Incline Software	Worked for Incline Software on Ancestral Quest (which later became PAF).	Apr 1998 – Sep 1999
  Waterford Institute	Developed educational software for children.	Jan 1998 – Apr 1998
  Scott+Charles Computer	Wrote a Windows version of GlassMaster software for Scott+Charles Computer. GlassMaster is software for running a glass shop.	May 1994 – Aug 1994

Projects

• I am an avid hobby-programmer. Here is a pictoral tour of logos and screen shots from some of the projects in which I have been involved. Each project has a story, so please ask, I'd love to talk about them.
• 
• 
• 
• 
• 
• 
• 
• 
• 
• 
• 
• 
• 
• 
• 
• 
• 
•