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, Silverman R.  1990.  Packing and covering the plane with translates of a convex polygon. Journal of Algorithms. 11(4):564-580.
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 D.  2005.  The ABCs of AVDs: Geometric Retrieval Made Simple. Algorithms and Computation. :819-826.
Mount SM, Steitz JA.  1981.  Sequence of U1 RNA from Drosophila melanogaster: implications for U1 secondary structure and possible involvement in splicing. Nucleic Acids ResearchNucl. Acids Res.. 9(23):6351-6368.
Mount D.  1985.  On Finding Shortest Paths on Convex Polyhedra..
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.  2000.  Genomic Sequence, Splicing, and Gene Annotation. American Journal of Human GeneticsAm J Hum Genet. 67(4):788-792.
Mount D.  1990.  The number of shortest paths on the surface of a polyhedron. SIAM Journal on Computing. 19:593-593.
Mount D, Silverman R, Wu AY.  1998.  On the Area of Overlap of Translated Polygons. CS-TR-3201
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, 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 SM, Chang C.  2002.  Evidence for a Plastid Origin of Plant Ethylene Receptor Genes. Plant PhysiologyPlant Physiol.. 130(1):10-14.
Mount SM.  2001.  Messenger RNA Splicing Signals. eLS.
Mount D.  1998.  ANN programming manual.
Mount D.  1992.  Intersection detection and separators for simple polygons. Proceedings of the eighth annual symposium on Computational geometry. :303-311.
Mount D, Arya S.  1997.  ANN: A library for approximate nearest neighbor searching. CGC 2nd Annual Fall Workshop on Computational Geometry.
Mount SM.  1996.  AT-AC Introns—An ATtACk on Dogma. ScienceScience. 271(5256):1690-1692.
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.
Motiwala M, bin Tariq M, Anwer B, Andersen D, Feamster N.  2009.  A Narrow Waist for Multipath Routing.
Motiwala M, Elmore M, Feamster N, Vempala S.  2008.  Path splicing. SIGCOMM Comput. Commun. Rev.. 38(4):27-38.
Motiwala M, Feamster N, Vempala S.  2007.  Path splicing: Reliable connectivity with rapid recovery. ACM SIGCOMM HotNets VI.
Motiwala M, Dhamdhere A, Feamster N, Lakhina A.  2012.  Towards a cost model for network traffic. SIGCOMM Comput. Commun. Rev.. 42(1):54-60.
Motesharrei S, Rivas J, Kalnay E, Asrar GR, Busalacchi AJ, Cahalan RF, Cane MA, Colwell RR, Feng K, Franklin RS et al..  2016.  Modeling Sustainability: Population, Inequality, Consumption, and Bidirectional Coupling of the Earth and Human Systems. National Science Review. :nww081.
Mosse D, Noh SH, Trinh B, Agrawala AK.  1993.  Multiple Resource Allocation for Multiprocessor Distributed Real-Time Systems. In Workshop on Parallel and Distributed Real-Time Systems (PDRTS), IEEE IPPS'93.
Morselli R, Katz J, Bhattacharjee B.  2004.  A game-theoretic framework for analyzing trust-inference protocols. Workshop on Economics of Peer-to-Peer Systems.

Pages