Publications

Export 7148 results:
[ Author(Asc)] Title 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
Mount D.  1985.  Voronoi Diagrams on the Surface of a Polyhedron..
Mount D.  1990.  The number of shortest paths on the surface of a polyhedron. SIAM Journal on Computing. 19:593-593.
Mount SM, Gotea V, Lin C-F, Hernandez K, Makałowski W.  2007.  Spliceosomal small nuclear RNA genes in 11 insect genomes. RNARNA. 13(1):5-14.
Mount SM.  1982.  A catalogue of splice junction sequences. Nucleic Acids ResearchNucl. Acids Res.. 10(2):459-472.
Mount D, Netanyahu NS.  1993.  Efficient algorithms for robust circular arc estimators. Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada.
Mount D, Stein C.  2002.  Algorithm Engineering and Experiments: 4th International Workshop, Alenex 2002, San Francisco, Ca, Usa, January 4-5. 2002 : Revised Papers.
Mount D.  1992.  Intersection detection and separators for simple polygons. Proceedings of the eighth annual symposium on Computational geometry. :303-311.
Mount D, Arya S.  1997.  ANN: A library for approximate nearest neighbor searching. CGC 2nd Annual Fall Workshop on Computational Geometry.
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.  2000.  Genomic Sequence, Splicing, and Gene Annotation. American Journal of Human GeneticsAm J Hum Genet. 67(4):788-792.
Mount D.  1985.  On Finding Shortest Paths on Convex Polyhedra..
Mount D, Park E.  2010.  A dynamic data structure for approximate range searching. Proceedings of the 2010 annual symposium on Computational geometry. :247-256.
Mount D, Netanyahu NS, Le Moigne J.  1997.  Efficient algorithms for robust feature matching. Image Registration Workshop Proceedings.
Mount D, Silverman R.  1991.  Combinatorial and computational aspects of Minkowski decompositions. Contemporary Mathematics. 119:107-124.
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, Netanyahu NS, Piatko CD, Silverman R, Wu AY.  2000.  Quantile approximation for robust statistical estimation and k-enclosing problems. International Journal of Computational Geometry and Applications. 10(6):593-608.
Mount SM, Chang C.  2002.  Evidence for a Plastid Origin of Plant Ethylene Receptor Genes. Plant PhysiologyPlant Physiol.. 130(1):10-14.
Motiwala M, bin Tariq M, Anwer B, Andersen D, Feamster N.  2009.  A Narrow Waist for Multipath Routing.
Motiwala M, Elmore M, Feamster N, Vempala S.  2008.  Path splicing. SIGCOMM Comput. Commun. Rev.. 38(4):27-38.
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, 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.

Pages