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
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, 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, Park E.  2010.  A dynamic data structure for approximate range searching. Proceedings of the 2010 annual symposium on Computational geometry. :247-256.
Mount SM, Chang C.  2002.  Evidence for a Plastid Origin of Plant Ethylene Receptor Genes. Plant PhysiologyPlant Physiol.. 130(1):10-14.
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 SM.  2001.  Messenger RNA Splicing Signals. eLS.
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, Silverman R.  1991.  Combinatorial and computational aspects of Minkowski decompositions. Contemporary Mathematics. 119:107-124.
Mount SM.  1996.  AT-AC Introns—An ATtACk on Dogma. ScienceScience. 271(5256):1690-1692.
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 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, 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, 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 SM, Salz HK.  2000.  Pre-Messenger RNA Processing Factors in the Drosophila Genome. The Journal of Cell BiologyJ Cell Biol. 150(2):F37-F44-F37-F44.
Mount D, Pu FT.  1999.  Binary space parititions in plücker space. Algorithm Engineering and Experimentation. :663-663.
Mount SM.  1993.  Messenger RNA splicing signals in Drosophila genes. Atlas of Drosophila Genes. :333-358.
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 D, Silverman R, Wu AY.  1998.  On the Area of Overlap of Translated Polygons. CS-TR-3201
Mount SM, Steitz JA.  1984.  RNA splicing and the involvement of small ribonucleoproteins. Modern cell biology. 3:249-297.
Mount SM, Burks C, Herts G, Stormo GD, White O, Fields C.  1992.  Splicing signals in Drosophila: intron size, information content, and consensus sequences. Nucleic Acids ResearchNucl. Acids Res.. 20(16):4255-4262.
Mount D, Chandran S.  1988.  A united approach to finding enclosing and enclosed triangles. Proceedings of 26th Allerton Conference on Communication, Control and Computing.
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.
Mount D.  1987.  Storing the subdivision of a polyhedral surface. Discrete & Computational Geometry. 2(1):153-174.

Pages