Publications

Search
Export 7147 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
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.
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.
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.
Arlat DPMCJ, Crouzet Y.  1996.  Estimation of time-dependent coverage. 96466
Arlt S, Banerjee I, Bertolini C, Memon AM, Schäf M.  2012.  Grey-box GUI Testing: Efficient Generation of Event Sequences. arXiv:1205.4928.
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.
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.
Arya S, Malamatos T, Mount D.  2001.  Entropy-preserving cuttings and space-efficient planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :256-261.
Arya S, Mount D, Narayan O.  1996.  Accounting for boundary effects in nearest-neighbor searching. Discrete & Computational Geometry. 16(2):155-176.
Arya S, Mount D, Vigneron A, Xia J.  2008.  Space-time tradeoffs for proximity searching in doubling spaces. Algorithms-ESA 2008. :112-123.
Arya S, Dast G, Mount D, Salowe JS, Smid M.  1995.  M.H.M: Euclidean spanners: short, thin, and lanky. In: 27th ACM Symposium on Theory of Computing. :489-498.
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.

Pages