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, Kanungo T, Netanyahu NS, Piatko C, Silverman R, Wu AY.  2001.  Approximating large convolutions in digital images. Image Processing, IEEE Transactions on. 10(12):1826-1835.
Mount SM.  1996.  AT-AC Introns—An ATtACk on Dogma. ScienceScience. 271(5256):1690-1692.
Mount D, Silverman R.  1998.  Minimum Enclosures with Specified Angles. CS-TR-3219
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, Saalfeld A.  1988.  Globally-Equiangular triangulations of co-circular points in 0(n log n) time. Proceedings of the fourth annual symposium on Computational geometry. :143-152.
Mount D, Netanyahu NS, Romanik K, Silverman R, Wu AY.  2007.  A practical approximation algorithm for the LMS line estimator. Computational Statistics & Data Analysis. 51(5):2461-2486.
Mount D, Netanyahu NS, Le Moigne J.  1999.  Efficient algorithms for robust feature matching. Pattern Recognition. 32(1):17-38.
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 SM.  1993.  Messenger RNA splicing signals in Drosophila genes. Atlas of Drosophila Genes. :333-358.
Mount D, Netanyahu NS.  2001.  Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.
Mount D, Silverman R.  1990.  Packing and covering the plane with translates of a convex polygon. Journal of Algorithms. 11(4):564-580.
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, 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–.
Mount SM, Steitz JA.  1984.  RNA splicing and the involvement of small ribonucleoproteins. Modern cell biology. 3:249-297.
Mount D.  2005.  The ABCs of AVDs: Geometric Retrieval Made Simple. Algorithms and Computation. :819-826.
Mount D, Pu F-T.  1998.  Stabbing Orthogonal Objects in 3-Space. UMIACS-TR-96-71
Mount D.  2006.  Keep Your Friends Close and Your Enemies Closer: The Art of Proximity Searching. Proceedings of the eighth Workshop on Algorithm Engineering and Experiments and the third Workshop on Analytic Algorithmics and Combinatorics. 123:65-65.
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 SM.  1997.  Genetic depletion reveals an essential role for an SR protein splicing factor in vertebrate cells. BioEssays. 19(3):189-192.
Mount SM.  1983.  RNA processing: Sequences that signal where to splice. Nature. 304(5924):309-310.
Mount D.  1990.  The number of shortest paths on the surface of a polyhedron. SIAM Journal on Computing. 19:593-593.
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 SM, Steitz J.  1983.  RNA processing: Lessons from mutant globins. Nature. 303(5916):380-381.
Mount D.  1985.  Voronoi Diagrams on the Surface of a Polyhedron..
Mount D.  1992.  Intersection detection and separators for simple polygons. Proceedings of the eighth annual symposium on Computational geometry. :303-311.

Pages