Publications

Export 447 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is M  [Clear All Filters]
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
Mount D.  1987.  Storing the subdivision of a polyhedral surface. Discrete & Computational Geometry. 2(1):153-174.
Mount SM.  2001.  Messenger RNA Splicing Signals. eLS.
Mount D, Gable CW.  2001.  A point-placement strategy for conforming Delaunay tetrahedralization. International Journal of Computational Geometry & Applications. 11(6):669-682.
Mount D.  1992.  Intersection detection and separators for simple polygons. Proceedings of the eighth annual symposium on Computational geometry. :303-311.
Mount D, Silverman R, Wu AY.  1998.  On the Area of Overlap of Translated Polygons. CS-TR-3201
Mount SM, Pettersson I, Hinterberger M, Karmas A, Steitz JA.  1983.  The U1 small nuclear RNA-protein complex selectively binds a 5′ splice site in vitro. Cell. 33(2):509-518.
Mount D, Pu FT.  1999.  Binary space parititions in plücker space. Algorithm Engineering and Experimentation. :663-663.
Mount D, Silverman R, Wu A.  1993.  On the area of overlap of translated polygons. SPIE Vision Geometry II. 2060:254-264.
Mount SM, Rubin GM.  1985.  Complete nucleotide sequence of the Drosophila transposable element copia: homology between copia and retroviral proteins.. Molecular and Cellular BiologyMol. Cell. Biol.. 5(7):1630-1638.
Mount D, Netanyahu NS, Le Moigne J.  1999.  Efficient algorithms for robust feature matching. Pattern Recognition. 32(1):17-38.
Mount SM, Steitz JA.  1981.  Sequence of U1 RNA from Drosophila melanogaster: implications for U1 secondary structure and possible involvement in splicing. Nucleic Acids ResearchNucl. Acids Res.. 9(23):6351-6368.
Mount D, Netanyahu NS, LeMoigne J.  1998.  Improved algorithms for robust point pattern matching and applications to image registration. Proceedings of the fourteenth annual symposium on Computational geometry. :155-164.
Mount SM.  1983.  RNA processing: Sequences that signal where to splice. Nature. 304(5924):309-310.
Mount D.  1985.  Voronoi Diagrams on the Surface of a Polyhedron..
Mount SM, Steitz J.  1983.  RNA processing: Lessons from mutant globins. Nature. 303(5916):380-381.
Motiwala M, Elmore M, Feamster N, Vempala S.  2008.  Path splicing. SIGCOMM Comput. Commun. Rev.. 38(4):27-38.
Motiwala M, bin Tariq M, Anwer B, Andersen D, Feamster N.  2009.  A Narrow Waist for Multipath Routing.
Motiwala M, Feamster N, Vempala S.  2007.  Path splicing: Reliable connectivity with rapid recovery. ACM SIGCOMM HotNets VI.
Motiwala M, Dhamdhere A, Feamster N, Lakhina A.  2012.  Towards a cost model for network traffic. SIGCOMM Comput. Commun. Rev.. 42(1):54-60.
Motesharrei S, Rivas J, Kalnay E, Asrar GR, Busalacchi AJ, Cahalan RF, Cane MA, Colwell RR, Feng K, Franklin RS et al..  2016.  Modeling Sustainability: Population, Inequality, Consumption, and Bidirectional Coupling of the Earth and Human Systems. National Science Review. :nww081.
Mosse D, Noh SH, Trinh B, Agrawala AK.  1993.  Multiple Resource Allocation for Multiprocessor Distributed Real-Time Systems. In Workshop on Parallel and Distributed Real-Time Systems (PDRTS), IEEE IPPS'93.
Morselli R, Katz J, Bhattacharjee B.  2004.  A game-theoretic framework for analyzing trust-inference protocols. Workshop on Economics of Peer-to-Peer Systems.
Morselli R, Bhattacharjee B, Katz J, Marsh M.  2007.  Exploiting approximate transitivity of trust. Broadband Communications, Networks and Systems, 2007. BROADNETS 2007. Fourth International Conference on. :515-524.
Morselli R, Bhattacharjee B, Katz J, Keleher P.  2004.  Trust-preserving set operations. INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies. 4:2231-2241vol.4-2231-2241vol.4.
Morselli R, Bhattacharjee B, Marsh MA, Srinivasan A.  2007.  Efficient lookup on unstructured topologies. IEEE Journal on Selected Areas in Communications. 25(1):62-72.

Pages