Publications
2009. The Maryland Modular Method: An Approach to Doctoral Education in Information Studies. Journal of education for library and information science. 50(4):293-301.
2004. MASS: Multiagent Security and Survivability. Monitoring, Security and Rescue Techniques in Multiagent Systems. :112-112.
1996. Matching convex polygons and polyhedra, allowing for occlusion. Applied Computational Geometry Towards Geometric Engineering. :133-147.
2006. Matching Jobs to Resources in Distributed Desktop Grid Environments. Technical Reports from UMIACS, UMIACS-TR-2006-15.
1988. Matching patterns in strings subject to multi-linear transformations. Theoretical Computer Science. 60(3):231-254.
2009. Matching person names through name transformation. Proceedings of the 18th ACM conference on Information and knowledge management. :1875-1878.
2005. Matching shape sequences in video with applications in human movement analysis. Pattern Analysis and Machine Intelligence, IEEE Transactions on. 27(12):1896-1909.
2003. Matching Software Measurements to Business Goals. Keynote Address at the 2003 Software Management Conference, San Jose, California.
2008. Matchmaking and implementation issues for a P2P desktop grid. Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on. :1-5.
2011. Materializing multi-relational databases from the web using taxonomic queries. Proceedings of the fourth ACM international conference on Web search and data mining. :355-364.
2008. Maternal depletion of CTCF reveals multiple functions during oocyte and preimplantation embryo development. Development. 135(16):2729-2738.
2009. Maturing Software Engineering Knowledge through Classifications: A Case Study on Unit Testing Techniques. Software Engineering, IEEE Transactions on. 35(4):551-565.
2006. MauveDB: supporting model-based user views in database systems. Proceedings of the 2006 ACM SIGMOD international conference on Management of data. :73-84.
1973. A max {m, n} algorithm for determining the graph H from its line graph G. Information Processing Letters. 2(4):108-112.
2011. Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). :797-806.
2011. Maximum bipartite flow in networks with adaptive channel width. Theoretical Computer Science. 412(24):2577-2587.