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 
A
Arya S, da Fonseca GD, Mount D.  2011.  Approximate polytope membership queries. Proceedings of 43rd Annual ACM Symposium on Theory of Computing. :579-586.
Arya S, Cheng S-W, Mount D.  1998.  Approximation algorithms for multiple-tool miling. Proceedings of the fourteenth annual symposium on Computational geometry. :297-306.
Arya S, Mount D, Smid M.  1994.  Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Computational Geometry: Theory and Applications. 13:13-91.
Arya S, Mount D, Netanyahu NS, Silverman R, Wu AY.  1998.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM (JACM). 45(6):891-923.
Arya S, Malamatos T, Mount D.  2002.  Space-efficient approximate Voronoi diagrams. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. :721-730.
Arya S, Mount D, Xia J.  2010.  Tight lower bounds for halfspace range searching. Proceedings of the 2010 annual symposium on Computational geometry. :29-37.
Arya S, Malamatos T, Mount D, Wong KC.  2007.  Optimal expected-case planar point location. SIAM Journal on Computing. 37(2):584-584.
Arya S, Mount D, Smid M.  1994.  Randomized and deterministic algorithms for geometric spanners of small diameter. Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. :703-712.
Arya S, Mount D.  1995.  Approximate range searching. Proceedings of the eleventh annual symposium on Computational geometry. :172-181.
Arya S, Malamatos T, Mount D.  2005.  Space-time tradeoffs for approximate spherical range counting. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. :535-544.
Arya S, Fonseca G, Mount D.  2008.  Tradeoffs in Approximate Range Searching Made Simpler. Computer Graphics and Image Processing, 2008. SIBGRAPI '08. XXI Brazilian Symposium on. :237-244.
Arya S, Malamatos T, Mount D.  2009.  Space-time tradeoffs for approximate nearest neighbor searching. Journal of the ACM (JACM). 57(1):1:1–1:54-1:1–1:54.
Arya S, Malamatos T, Mount D.  2006.  On the importance of idempotence. Proceedings of the thirty-eighth annual ACM symposium on Theory of computing. :564-573.
Arya S, Mount D.  1993.  Algorithms for fast vector quantization. Data Compression Conference, 1993. DCC '93.. :381-390.
Arya S, Mount D.  2000.  Approximate range searching. Computational Geometry. 17(3–4):135-152.
Arya S, da Fonseca G, Mount D.  2010.  A unified approach to approximate proximity searching. Algorithms–ESA 2010. :374-385.
Aryangat S, Andrade H, Sussman A.  2004.  Time and space optimization for processing groups of multi-dimensional scientific queries. Proceedings of the 18th annual international conference on Supercomputing. :95-105.
Asahi T, Turo D, Shneiderman B.  1995.  Using Treemaps to Visualize the Analytic Hierarchy Process. Information Systems ResearchInformation Systems Research. 6(4):357-375.
Asahi T, Turo D, Shneiderman B.  1995.  Visual decision-making: using treemaps for the analytic hierarchy process. Conference companion on Human factors in computing systems. :405-406.
Asgari S, Hochstein L, Basili VR, Zelkowitz MV, Hollingsworth J, Carver J, Shull F.  2005.  Generating testable hypotheses from tacit knowledge for high productivity computing. Proceedings of the second international workshop on Software engineering for high performance computing system applications. :17-21.
Asgari S, Basili VR, Costa P, Donzelli P, Hochstein L, Lindvall M, Rus I, Shull F, Tvedt R, Zelkowitz MV.  2004.  Empirical-based estimation of the effect on software dependability of a technique for architecture conformance verification. Proceedings of the ICSE 2004 Workshop on Architecting Dependable Systems, Edinburgh, UK.
Asgari S, Basili VR, Carver J, Hochstein L, Hollingsworth J, Zelkowitz MV.  2004.  Challenges in Measuring HPCS Learner Productivity in an Age of Ubiquitous Computing: The HPCS Program. In Proceedings of ICSE Workshop on High Productivity Computing. May 2004.
Atalay FB, Mount D.  2003.  Interpolation over light fields with applications in computer graphics. Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments. :56-68.
Atalay FB, Mount D.  2002.  Ray interpolants for fast raytracing reflections and refractions. Journal of WSCG (Proc. International Conf. in Central Europe on Comp. Graph., Visualization and Comp. Vision). 10(3):1-8.
Atalay FB, Mount D, Mitchell J.  2007.  Pointerless implementation of hierarchical simplicial meshes and efficient neighbor finding in arbitrary dimensions. International Journal of Computational Geometry and Applications. 17(6):595-631.

Pages