Publications

Export 7148 results:
[ Author(Desc)] 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
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.
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.
Mount SM.  1997.  Genetic depletion reveals an essential role for an SR protein splicing factor in vertebrate cells. BioEssays. 19(3):189-192.
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 SM.  1983.  RNA processing: Sequences that signal where to splice. Nature. 304(5924):309-310.
Mount D, Netanyahu NS, Le Moigne J.  1997.  Efficient algorithms for robust feature matching. Image Registration Workshop Proceedings.
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, Silverman R.  1991.  Combinatorial and computational aspects of Minkowski decompositions. Contemporary Mathematics. 119:107-124.
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 D.  1991.  The densest double-lattice packing of a convex polygon. Discrete and Computational Geometry: Papers from the DIMACS Special Year. 6:245-262.
Mount SM, Steitz J.  1983.  RNA processing: Lessons from mutant globins. Nature. 303(5916):380-381.
Mount D, Netanyahu NS, Romanik K, Silverman R, Wu AY.  1997.  A practical approximation algorithm for the LMS line estimator. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :473-482.
Mount D.  1997.  Geometric intersection. Handbook of Discrete and Computational Geometry, chapter 33. :615-632.
Mount D.  1985.  On Finding Shortest Paths on Convex Polyhedra..
Mount D, Netanyahu NS, Zuck E.  2004.  Analyzing the number of samples required for an approximate Monte-Carlo LMS line estimator. Theory and Applications of Recent Robust MethodsTheory and Applications of Recent Robust Methods. :207-219.
Mount D, Pu FT.  1999.  Binary space parititions in plücker space. Algorithm Engineering and Experimentation. :663-663.
Mount SM, Green MM, Rubin GM.  1988.  Partial Revertants of the Transposable Element-Associated Suppressible Allele White-Apricot in Drosophila Melanogaster: Structures and Responsiveness to Genetic Modifiers. GeneticsGenetics. 118(2):221-234.
Mount D, Netanyahu NS, Ratanasanya S.  2010.  New Approaches to Robust, Point-Based Image Registration. Image Registration for Remote SensingImage Registration for Remote Sensing.
Mount SM.  1987.  Sequence similarity. Nature. 325(6104):487-487.
Mount D, Silverman R, Wu AY.  1998.  On the Area of Overlap of Translated Polygons. CS-TR-3201
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, Piatko CD, Silverman R, Wu AY.  2004.  A computational framework for incremental motion. Proceedings of the twentieth annual symposium on Computational geometry. :200-209.

Pages