Publications
Export 447 results:
[ Author] Title Type Year Filters: First Letter Of Last Name is M [Clear All Filters]
2004. A computational framework for incremental motion. Proceedings of the twentieth annual symposium on Computational geometry. :200-209.
2000. Chromatic nearest neighbor searching: A query sensitive approach. Computational Geometry. 17(3–4):97-119.
1997. Genetic depletion reveals an essential role for an SR protein splicing factor in vertebrate cells. BioEssays. 19(3):189-192.
2000. Quantile approximation for robust statistical estimation and k-enclosing problems. International Journal of Computational Geometry and Applications. 10(6):593-608.
1998. ANN programming manual.
1991. Combinatorial and computational aspects of Minkowski decompositions. Contemporary Mathematics. 119:107-124.
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.
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.
2001. Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses. Computational Geometry. 19(1):1-33.
2002. Evidence for a Plastid Origin of Plant Ethylene Receptor Genes. Plant PhysiologyPlant Physiol.. 130(1):10-14.
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.
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.
2007. A practical approximation algorithm for the LMS line estimator. Computational Statistics & Data Analysis. 51(5):2461-2486.
2001. Approximating large convolutions in digital images. Image Processing, IEEE Transactions on. 10(12):1826-1835.
1983. The U1 small nuclear RNA-protein complex selectively binds a 5′ splice site in vitro. Cell. 33(2):509-518.
1988. A united approach to finding enclosing and enclosed triangles. Proceedings of 26th Allerton Conference on Communication, Control and Computing.