Publications

Export 7148 results:
[ Author(Desc)] 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
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.
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.
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 D, Silverman R.  1998.  Minimum Enclosures with Specified Angles. CS-TR-3219
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, 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 SM.  2000.  Genomic Sequence, Splicing, and Gene Annotation. American Journal of Human GeneticsAm J Hum Genet. 67(4):788-792.
Mount D, Netanyahu NS, Le Moigne J.  1999.  Efficient algorithms for robust feature matching. Pattern Recognition. 32(1):17-38.
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, Netanyahu NS.  1994.  Computationally Efficient Algorithms for High-Dimensional Robust Estimators. CVGIP: Graphical Models and Image Processing. 56(4):289-303.
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.  1990.  Packing and covering the plane with translates of a convex polygon. Journal of Algorithms. 11(4):564-580.
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.  2001.  Messenger RNA Splicing Signals. eLS.
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 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.  1996.  AT-AC Introns—An ATtACk on Dogma. ScienceScience. 271(5256):1690-1692.
Mount D.  1990.  The number of shortest paths on the surface of a polyhedron. SIAM Journal on Computing. 19:593-593.

Pages