Export 7147 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 
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.  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, 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, 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.
Arya S, da Fonseca GD, Mount D.  2012.  Polytope approximation and the Mahler volume. Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. :29-42.
Arya S, Phamdo N, Farvardin N, Mount D.  1993.  Fast search algorithms with applications to split and multi-stage vector quantization of speech lsp parameters. Speech Coding for Telecommunications, 1993. Proceedings., IEEE Workshop on. :65-66.
Arya S, Mount D.  1993.  Approximate nearest neighbor queries in fixed dimensions. Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms. :271-280.
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 EM, Khuller S, Mitchell JSB.  1993.  Geometric knapsack problems. Algorithmica. 10(5):399-427.
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.
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.  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, 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.
Arbaugh WA, Keromytis AD, Smith JM.  1998.  DHCP++: Applying an efficient implementation method for fail-stop cryptographic protocols. Proceedings of Global Internet (GlobeCom)’98. :59-65.