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 
A
Arya S, Mount D.  1993.  Approximate nearest neighbor searching. Proceedings of 4th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’93). :271-280.
Arya S, Das G, Mount D, Salowe JS, Smid M.  1995.  Euclidean spanners: short, thin, and lanky. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :489-498.
Arya S, Cheng SW, Mount D, Ramesh H.  2000.  Efficient expected-case algorithms for planar point location. Algorithm Theory-SWAT 2000. :537-543.
Arya S, Malamatos T, Mount D.  2001.  A simple entropy-based algorithm for planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :262-268.
Arya S, Malamatos T, Mount D.  2009.  The effect of corners on the complexity of approximate range searching. Discrete & Computational Geometry. 41(3):398-443.
Arya S, Malamatos T, Mount D.  2000.  Nearly optimal expected-case planar point location. Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. :208-218.
Arya S, Malamatos T, Mount D.  2007.  A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms (TALG). 3(2)
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.
Armentrout SL, Reggia JA, Weinrich M.  1994.  A neural model of cortical map reorganization following a focal lesion. Artificial Intelligence in Medicine. 6(5):383-400.
Arlt S, Banerjee I, Bertolini C, Memon AM, Schäf M.  2012.  Grey-box GUI Testing: Efficient Generation of Event Sequences. arXiv:1205.4928.
Arlat DPMCJ, Crouzet Y.  1996.  Estimation of time-dependent coverage. 96466
Arkin E, Goodrich M, Mitchell J, Mount D, Piatko C, Skiena S.  1993.  Point probe decision trees for geometric concept classes. Algorithms and Data Structures. :95-106.
Arkin EM, Belleville P, Mitchell JSB, Mount D, Romanik K, Salzberg S, Souvaine D.  1997.  Testing simple polygons. Computational Geometry. 8(2):97-114.
Arkin EM, Khuller S, Mitchell JSB.  1993.  Geometric knapsack problems. Algorithmica. 10(5):399-427.
Aris A, Shneiderman B.  2007.  Designing Semantic Substrates for Visual Network Exploration. Information VisualizationInformation Visualization. 6(4):281-300.
Aris A, Shneiderman B.  2008.  A Node Aggregation Strategy to Reduce Complexity of Network Visualization using Semantic Substrates.
Aris A, Shneiderman B, Plaisant C, Shmueli G, Jank W.  2005.  Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration. Human-Computer Interaction - INTERACT 2005Human-Computer Interaction - INTERACT 2005. 3585:835-846.
Aris A, Shneiderman B, Plaisant C, Shmueli G, Jank W.  2005.  Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration (2005). Institute for Systems Research Technical Reports.
Aris A, Shneiderman B, Qazvinian V, Radev D.  2009.  Visual overviews for discovering key papers and influences across research fronts. Journal of the American Society for Information Science and Technology. 60(11):2219-2228.
Archer A, Bateni MH, Hajiaghayi MT, Karloff H.  2009.  Improved approximation algorithms for prize-collecting Steiner tree and TSP. 2009 50th Annual IEEE Symposium on Foundations of Computer Science. :427-436.
Arbaugh WA, Fithen WL, McHugh J.  2000.  Windows of Vulnerability: A Case Study Analysis. Computer. 33(12):52-59.

Pages