Publications
Export 447 results:
[ Author] Title Type Year Filters: First Letter Of Last Name is M [Clear All Filters]
1994. Computationally Efficient Algorithms for High-Dimensional Robust Estimators. CVGIP: Graphical Models and Image Processing. 56(4):289-303.
2010. A dynamic data structure for approximate range searching. Proceedings of the 2010 annual symposium on Computational geometry. :247-256.
2004. A computational framework for incremental motion. Proceedings of the twentieth annual symposium on Computational geometry. :200-209.
2000. Genomic Sequence, Splicing, and Gene Annotation. American Journal of Human GeneticsAm J Hum Genet. 67(4):788-792.
2000. Chromatic nearest neighbor searching: A query sensitive approach. Computational Geometry. 17(3–4):97-119.
1992. Splicing signals in Drosophila: intron size, information content, and consensus sequences. Nucleic Acids ResearchNucl. Acids Res.. 20(16):4255-4262.
2000. Quantile approximation for robust statistical estimation and k-enclosing problems. International Journal of Computational Geometry and Applications. 10(6):593-608.
1982. A catalogue of splice junction sequences. Nucleic Acids ResearchNucl. Acids Res.. 10(2):459-472.
1991. Combinatorial and computational aspects of Minkowski decompositions. Contemporary Mathematics. 119:107-124.
1998. ANN programming manual.
2000. Pre-Messenger RNA Processing Factors in the Drosophila Genome. The Journal of Cell BiologyJ Cell Biol. 150(2):F37-F44-F37-F44.
2010. New Approaches to Robust, Point-Based Image Registration. Image Registration for Remote SensingImage Registration for Remote Sensing.
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–.
2002. Partitioning planar graphs with costs and weights. 4th International Workshop on Algorithm Engineering and Experiments. 2409:98-110.
1997. Genetic depletion reveals an essential role for an SR protein splicing factor in vertebrate cells. BioEssays. 19(3):189-192.
2001. Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.
1991. The densest double-lattice packing of a convex polygon. Discrete and Computational Geometry: Papers from the DIMACS Special Year. 6:245-262.
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.