Publications

Export 7151 results:
Author [ Title(Asc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
M
Saha B, Getoor L.  2009.  On maximum coverage in the streaming model & application to multi-topic blog-watch. 2009 SIAM International Conference on Data Mining (SDM09).
Azar Y, Mądry A, Moscibroda T, Panigrahi D, Srinivasan A.  2011.  Maximum bipartite flow in networks with adaptive channel width. Theoretical Computer Science. 412(24):2577-2587.
Li J, Deshpande A.  2011.  Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems. 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS). :797-806.
Roussopoulos N.  1973.  A max {m, n} algorithm for determining the graph H from its line graph G. Information Processing Letters. 2(4):108-112.
Deshpande A, Madden S.  2006.  MauveDB: supporting model-based user views in database systems. Proceedings of the 2006 ACM SIGMOD international conference on Management of data. :73-84.
Vegas S, Juristo N, Basili VR.  2009.  Maturing Software Engineering Knowledge through Classifications: A Case Study on Unit Testing Techniques. Software Engineering, IEEE Transactions on. 35(4):551-565.
Stewart G.W, Author, Mahajan A, Reviewer.  2003.  Matrix Algorithms, Volume II: Eigensystems. Applied Mechanics Reviews. 56(1):B2-B2-B2-B2.
Stewart G.W.  2001.  Matrix Algorithms: Eigensystems.
Stewart G.W.  1998.  Matrix Algorithms: Basic decompositions.
Mayergoyz ID.  2003.  Mathematical models of hysterisis and their applications (2003). Recherche. 67:02-02.
Mayergoyz ID.  2006.  MATHEMATICAL MODELS OF HYSTERESIS (DYNAMIC PROBLEMS IN HYSTERESIS).
Mayergoyz ID.  2003.  Mathematical Models of Hysteresis and Their Applications: Second Edition.
Wan L-B, Pan H, Hannenhalli S, Cheng Y, Ma J, Fedoriw A, Lobanenkov V, Latham KE, Schultz RM, Bartolomei MS.  2008.  Maternal depletion of CTCF reveals multiple functions during oocyte and preimplantation embryo development. Development. 135(16):2729-2738.
Michelson M, Macskassy SA, Minton SN, Getoor L.  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.
Roussopoulos N.  1998.  Materialized views and data warehouses. ACM SIGMOD RecordSIGMOD Rec.. 27(1):21-26.
Marsh M, Kim J-S, Nam B, Lee J, Ratanasanya S, Bhattacharjee B, Keleher P, Richardson D, Wellnitz D.  2008.  Matchmaking and implementation issues for a P2P desktop grid. Parallel and Distributed Processing, 2008. IPDPS 2008. IEEE International Symposium on. :1-5.
Basili VR.  2003.  Matching Software Measurements to Business Goals. Keynote Address at the 2003 Software Management Conference, San Jose, California.
A V, Roy-Chowdhury AK, Chellappa R.  2005.  Matching shape sequences in video with applications in human movement analysis. Pattern Analysis and Machine Intelligence, IEEE Transactions on. 27(12):1896-1909.
Gong J, Wang L, Oard D.  2009.  Matching person names through name transformation. Proceedings of the 18th ACM conference on Information and knowledge management. :1875-1878.
Eilam-Tzoreff T, Vishkin U.  1988.  Matching patterns in strings subject to multi-linear transformations. Theoretical Computer Science. 60(3):231-254.
Kim J-S, Bhattacharjee B, Keleher PJ, Sussman A.  2006.  Matching Jobs to Resources in Distributed Desktop Grid Environments. Technical Reports from UMIACS, UMIACS-TR-2006-15.
Basri R, Jacobs DW.  1996.  Matching convex polygons and polyhedra, allowing for occlusion. Applied Computational Geometry Towards Geometric Engineering. :133-147.
Jacobs DW.  1997.  Matching 3-D models to 2-D images. International Journal of Computer Vision. 21(1):123-153.
V.S. Subrahmanian.  2004.  MASS: Multiagent Security and Survivability. Monitoring, Security and Rescue Techniques in Multiagent Systems. :112-112.
Druin A, Jaeger PT, Golbeck J, Fleischmann KR, Jimmy Lin, Qu Y, Wang P, Xie B.  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.

Pages