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, 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, Stein C.  2002.  Partitioning planar graphs with costs and weights. 4th International Workshop on Algorithm Engineering and Experiments. 2409:98-110.
Mount SM.  1983.  RNA processing: Sequences that signal where to splice. Nature. 304(5924):309-310.
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 SM, Steitz J.  1983.  RNA processing: Lessons from mutant globins. Nature. 303(5916):380-381.
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.  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 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 D, Pu F-T.  1998.  Stabbing Orthogonal Objects in 3-Space. UMIACS-TR-96-71
Mount SM, Green MM, Rubin GM.  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.
Mount SM.  1987.  Sequence similarity. Nature. 325(6104):487-487.
Mount SM, Rubin GM.  1985.  Complete nucleotide sequence of the Drosophila transposable element copia: homology between copia and retroviral proteins.. Molecular and Cellular BiologyMol. Cell. Biol.. 5(7):1630-1638.
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.
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, Bhattacharjee B, Srinivasan A, Marsh MA.  2005.  Efficient lookup on unstructured topologies. Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing. :77-86.

Pages