Welcome! I recently graduated from the University of New Hampshire with a Ph.D. in Computer Science. While at UNH, I was a member of the UNH AI Group, where I worked with Professor Wheeler Ruml in the area of Combinatorial Search. I am interested in problems where advanced algorithmic ideas can contribute to bringing previously intractable problems within reach. My research focus was in scaling combinatorial search algorithms with parallel processing, external memory, and techniques that achieve linear space complexity. I am currently a Senior Software Engineer at IBM where I work on adapting IBM's Watson technology to new domains.
Matthew Hatem and Wheeler Ruml, Simpler Bounded Suboptimal Search, Proceedings of the Twenty-eigth AAAI Conference on Artificial Intelligence, 2014 PDF
Matthew Hatem, Roni Stern, and Wheeler Ruml, Bounded Suboptimal Search in Linear Space, Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013 PDF
Matthew Hatem and Wheeler Ruml, External Memory Best-First Search for Multiple Sequence Alignment, Proceedings of the Twenty-seventh AAAI Conference on Artificial Intelligence, 2013 PDF
Chris Biemann, Bonaventura Coppola, Michael R. Glass, Alfio Gliozzo, Matthew Hatem and Martin Riedl, JoBimText Visualizer: A Graph-based Approach to Contextualizing Distributional Similarity, Proceedings of the EMNLP-13 Workshop on Graph-based Algorithms for Natural Language Processing (TextGraphs-8), 2013 PDF
Ethan Burns, Matthew Hatem, Michael J. Leighton, and Wheeler Ruml, Implementing Fast Heuristic Search Code, Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012 PDF
Matthew Hatem, Ethan Burns, and Wheeler Ruml, Heuristic Search for Large Problems With Real Costs, Proceedings of the Twenty-fifth AAAI Conference on Artificial Intelligence, 2011 PDF