Publications

Export 447 results:
[ Author(Desc)] 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.  1990.  The number of shortest paths on the surface of a polyhedron. SIAM Journal on Computing. 19:593-593.
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.  1997.  Geometric intersection. Handbook of Discrete and Computational Geometry, chapter 33. :615-632.
Mount SM.  1982.  A catalogue of splice junction sequences. Nucleic Acids ResearchNucl. Acids Res.. 10(2):459-472.
Mount D, Silverman R.  1990.  Packing and covering the plane with translates of a convex polygon. Journal of Algorithms. 11(4):564-580.
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, Netanyahu NS.  1993.  Efficient algorithms for robust circular arc estimators. Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario, Canada.
Mount D.  1985.  On Finding Shortest Paths on Convex Polyhedra..
Mount D, Netanyahu NS.  1994.  Computationally Efficient Algorithms for High-Dimensional Robust Estimators. CVGIP: Graphical Models and Image Processing. 56(4):289-303.
Mount D, Netanyahu NS, Le Moigne J.  1997.  Efficient algorithms for robust feature matching. Image Registration Workshop Proceedings.
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 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, Netanyahu NS, Silverman R, Wu AY.  2000.  Chromatic nearest neighbor searching: A query sensitive approach. Computational Geometry. 17(3–4):97-119.
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 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.  2005.  The ABCs of AVDs: Geometric Retrieval Made Simple. Algorithms and Computation. :819-826.
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.  1998.  ANN programming manual.
Mount D, Silverman R.  1991.  Combinatorial and computational aspects of Minkowski decompositions. Contemporary Mathematics. 119:107-124.
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, Stein C.  2002.  Partitioning planar graphs with costs and weights. 4th International Workshop on Algorithm Engineering and Experiments. 2409:98-110.
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, Chang C.  2002.  Evidence for a Plastid Origin of Plant Ethylene Receptor Genes. Plant PhysiologyPlant Physiol.. 130(1):10-14.
Mount D, Silverman R.  1987.  Algorithms for covering and packing and applications to CAD/CAM (abstract only): preliminary results. Proceedings of the 15th annual conference on Computer Science. :439–-439–.

Pages