Publications
Export 325 results:
[ Author] Title Type Year Filters: First Letter Of Last Name is A [Clear All Filters]
2008. A Node Aggregation Strategy to Reduce Complexity of Network Visualization using Semantic Substrates.
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. M.H.M: Euclidean spanners: short, thin, and lanky. In: 27th ACM Symposium on Theory of Computing. :489-498.
1995. Approximate range searching. Proceedings of the eleventh annual symposium on Computational geometry. :172-181.
1995. Euclidean spanners: short, thin, and lanky. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :489-498.
2007. A simple entropy-based algorithm for planar point location. ACM Transactions on Algorithms (TALG). 3(2)
1993. Algorithms for fast vector quantization. Data Compression Conference, 1993. DCC '93.. :381-390.
2005. Space-time tradeoffs for approximate spherical range counting. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms. :535-544.
2000. Nearly optimal expected-case planar point location. Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. :208-218.
2010. Tight lower bounds for halfspace range searching. Proceedings of the 2010 annual symposium on Computational geometry. :29-37.
2001. Entropy-preserving cuttings and space-efficient planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :256-261.
2008. Tradeoffs in Approximate Range Searching Made Simpler. Computer Graphics and Image Processing, 2008. SIBGRAPI '08. XXI Brazilian Symposium on. :237-244.
1998. An optimal algorithm for approximate nearest neighbor searching fixed dimensions. Journal of the ACM (JACM). 45(6):891-923.
1993. Approximate nearest neighbor queries in fixed dimensions. Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms. :271-280.
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.
2008. Space-time tradeoffs for proximity searching in doubling spaces. Algorithms-ESA 2008. :112-123.
1994. Randomized and deterministic algorithms for geometric spanners of small diameter. Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. :703-712.
2001. A simple entropy-based algorithm for planar point location. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :262-268.
1994. Dynamic algorithms for geometric spanners of small diameter: Randomized solutions. Computational Geometry: Theory and Applications. 13:13-91.