Publications

Papamanthou C, Tollis IG. 2010. Applications of Parameterized st-Orientations. Journal of Graph Algorithms and Applications. 14(2):337-365.

Nau DS, Au T-C, Ilghami O, Kuter U, Wu D, Yaman F, Munoz-Avila H, Murdock JW. 2005. Applications of SHOP and SHOP2. Intelligent Systems, IEEE. 20(2):34-41.

Doermann D, Rivlin E, Weiss I. 1996. Applying algebraic and differential invariants for logo recognition. Machine Vision and Applications. 9(2):73-86.

Madnani N, Resnik P, Dorr BJ, Schwartz R. 2008. Applying automatically generated semantic knowledge: A case study in machine translation. NSF Symposium on Semantic Knowledge Discovery, Organization and Use.

Iseki O, Shneiderman B. 1986. Applying direct manipulation concepts: direct manipulation dik operating system (DMDOS). SIGSOFT Softw. Eng. Notes. 11(2):22-26.

Krishna AS, Yilmaz C, Memon AM, Porter A, Schmidt DC, Gokhale A, Natarajan B. 2004. Applying Model-based Distributed Continuous Quality Assurance Processes to Enhance Persistent Software Attributes. IEEE Software. 21(6):32-40.

Srinivasan A. 2003. On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.

Arya S, Mount D. 1993. Approximate nearest neighbor searching. Proceedings of 4th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’93). :271-280.

Cole R, Vishkin U. 1991. Approximate parallel scheduling. II. Applications to logarithmic-time optimal parallel graph algorithms. Information and Computation. 92(1):1-47.

Cole R, Vishkin U. 1988. Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM Journal on Computing. 17:128-128.

Davis LS, Roussopoulos N. 1980. Approximate pattern matching in a pattern database system. Information Systems. 5(2):107-119.

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, Mount D. 2000. Approximate range searching. Computational Geometry. 17(3–4):135-152.

da Fonseca GD, Mount D. 2010. Approximate range searching: The absolute model. Computational Geometry. 43(4):434-444.

Elman H. 1989. Approximate Schur Complement Preconditioners on Serial and Parallel Computers. SIAM Journal on Scientific and Statistical ComputingSIAM J. Sci. and Stat. Comput.. 10(3):581-581.

Mount D, Kanungo T, Netanyahu NS, Piatko C, Silverman R, Wu AY. 2001. Approximating large convolutions in digital images. Image Processing, IEEE Transactions on. 10(12):1826-1835.

Kanungo T, Mount D, Netanyahu NS, Piatko C, Silverman R, Wu AY. 1998. Approximating large convolutions in digital images. PROCEEDINGS-SPIE THE INTERNATIONAL SOCIETY FOR OPTICAL ENGINEERING. :216-227.

Baveja A, Srinivasan A. 2000. Approximating low-congestion routing and column-restricted packing problems. Information Processing Letters. 74(1–2):19-25.

Feige U, Halldórsson MM, Kortsarz G, Srinivasan A. 2003. Approximating the domatic number. SIAM Journal on Computing. 32(1):172-195.

Algazi VR, Duda RO, Duraiswami R, Gumerov NA, Tang Z. 2002. Approximating the head-related transfer function using simple geometric models of the head and torso. The Journal of the Acoustical Society of America. 112:2053-2053.

Rohloff KR, Khuller S, Kortsarz G. 2006. Approximating the minimal sensor selection for supervisory control. Discrete Event Dynamic Systems. 16(1):143-170.

Khuller S, Raghavachari B, Young N. 1995. Approximating the minimum equivalent digraph. SIAM Journal on Computing (SICOMP). 24(4):859-872.

Friedler SA, Mount D. 2010. Approximation algorithm for the kinetic robust K-center problem. Computational Geometry. 43(6–7):572-586.

Gandhi R, Khuller S, Srinivasan A, Wang N. 2006. Approximation algorithms for channel allocation problems in broadcast networks. Networks. 47(4):225-236.

Guha S, Khuller S. 1998. Approximation algorithms for connected dominating sets. Algorithmica. 20(4):374-387.

Pages

Publications