Publications
Export 7148 results:
[ Author] Title Type Year Filters: Bible-parallel-corpus-annotating-%E2%80%98book-2000-tongues%E2%80%99 is [Clear All Filters]
2005. Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration. Human-Computer Interaction - INTERACT 2005Human-Computer Interaction - INTERACT 2005. 3585:835-846.
2005. Representing Unevenly-Spaced Time Series Data for Visualization and Interactive Exploration (2005). Institute for Systems Research Technical Reports.
2007. Designing Semantic Substrates for Visual Network Exploration. Information VisualizationInformation Visualization. 6(4):281-300.
2008. A Node Aggregation Strategy to Reduce Complexity of Network Visualization using Semantic Substrates.
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.
1993. Point probe decision trees for geometric concept classes. Algorithms and Data Structures. :95-106.
1994. A neural model of cortical map reorganization following a focal lesion. Artificial Intelligence in Medicine. 6(5):383-400.
1995. Euclidean spanners: short, thin, and lanky. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :489-498.
1993. Approximate nearest neighbor searching. Proceedings of 4th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’93). :271-280.
2001. A simple entropy-based algorithm for planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :262-268.
2009. The effect of corners on the complexity of approximate range searching. Discrete & Computational Geometry. 41(3):398-443.
2000. Efficient expected-case algorithms for planar point location. Algorithm Theory-SWAT 2000. :537-543.
2000. Nearly optimal expected-case planar point location. Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. :208-218.
2007. A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms (TALG). 3(2)
2011. Approximate polytope membership queries. Proceedings of 43rd Annual ACM Symposium on Theory of Computing. :579-586.
1998. Approximation algorithms for multiple-tool miling. Proceedings of the fourteenth annual symposium on Computational geometry. :297-306.
1994. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Computational Geometry: Theory and Applications. 13:13-91.
2002. Space-efficient approximate Voronoi diagrams. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing. :721-730.
1998. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM (JACM). 45(6):891-923.
2010. Tight lower bounds for halfspace range searching. Proceedings of the 2010 annual symposium on Computational geometry. :29-37.