I am currently a PhD student in computer science at the University of Waterloo, under the supervision of Shai Ben-David. I am part of the Artificial Intelligence group, and more specifically I am studying the area of machine learning.

Research Interests

Artificial Intelligence, machine learning, clustering theory, SVMs, complexity theory, parameterized complexity, game theory.

Journal Articles

C. Boucher, D. Loker and M. Omanovic. ``Graph isomorphism completeness for perfect graphs and subclasses of perfect graphs.'' Congreesus Numerantium. Vol 185. pp 3-12. (Earlier extended abstract appeared at 38th Southeastern International Conference on Combinatorics, Graph Theory, and Computing. March 2007.)

Refereed Conferences

M. Ackerman, S. Ben-David and D. Loker. ``Towards Property-Based Classification of Clustering Paradigms.'' Neural Information Processing Systems (NIPS). Vancouver, Canada. 2010. To appear. (24% acceptance)

M. Ackerman, S. Ben-David and D. Loker. ``Characterization of Linkage-Based Clustering.'' Conference on Learning Theory (COLT). Haifa, Israel. 2010. (32% acceptance) [pdf]

D. Loker and K. Larson. ``Parameterizing the winner determination problem for combinatorial auctions.'' Ninth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010) (Highly refereed conference) (short paper) [pdf]

D. Loker and K. Larson. ``An investigation of representations of combinatorial auctions.'' Ninth International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010) (Highly refereed conference) (short paper) [pdf]

C. Boucher, D. Loker. ``Expected approximation guarantees for the demand matching problem.'' 2nd International Conference on Algorithmic Operations Research (AlgOR 2007)

Refereed Workshops and Symposia

M. Ackerman, S. Ben-David and D.Loker. ``Characterization of linkage-based clustering.'' NIPS 2009 Workshop ``Clustering: Science or Art? Towards Principled Approaches.''. 4 page extended abstract.

D. Loker. ``Graph isomorphism and recognition of self-complementary graphs.'' Discrete Math Day. Carleton University. Ottawa, ON. 2006.

D. Loker and C. Boucher. ``Combinatorial auctions and winner determination on graphs.'' Ontario Combinatorics Workshop. Fields Institute. Toronto, ON.

Technical Reports

C. Boucher and D. Loker. ``Expected approximation guarantees for the demand matching problem.'' Technical Report CS-2006-33, David R. Cheriton School of Computer Science, University of Waterloo, September 2006. [pdf]

C. Boucher and D. Loker. ``Graph isomorphism completeness for perfect graphs and subclasses of perfect graphs.'' Technical Report CS-2006-32, David R. Cheriton School of Computer Science, University of Waterloo, August 2006. [pdf]

Thesis

My master's thesis, ``Representations and Parameterizations of Combinatorial Auctions,'' is avaliable at uwspace.