Publications

Export 7151 results:
Author [ Title(Desc)] Type Year
Filters: Some-history-conjugate-gradient-and-lanczos-algorithms-1948%E2%80%931976 is   [Clear All Filters]
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
Chu D, Deshpande A, Hellerstein JM, Hong W.  2006.  Approximate Data Collection in Sensor Networks using Probabilistic Models. Proceedings of the 22nd International Conference on Data Engineering, 2006. ICDE '06. :48-48.
Shirdhonkar S, Jacobs DW.  2008.  Approximate earth mover's distance in linear time. Computer Vision and Pattern Recognition, 2008. CVPR 2008. IEEE Conference on. :1-8.
Raykar VC, Duraiswami R.  2005.  Approximate expressions for the mean and the covariance of the maximum likelihood estimator for acoustic source localization. Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP '05). IEEE International Conference on. 3:iii/73-iii/76Vol.3-iii/73-iii/76Vol.3.
Hussein ME, Abd-Almageed W.  2009.  Approximate kernel matrix computation on GPUs forlarge scale learning applications. Proceedings of the 23rd international conference on Supercomputing. :511-512.
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, Mount D.  1993.  Approximate nearest neighbor searching. Proceedings of 4th Annual ACMSIAM Symposium on Discrete Algorithms (SODA’93). :271-280.
Goodrich MT, Matias Y, Vishkin U.  1993.  Approximate parallel prefix computation and its applications. Parallel Processing Symposium, 1993., Proceedings of Seventh International. :318-325.
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.
Arya S, Mount D.  1995.  Approximate range searching. Proceedings of the eleventh annual symposium on Computational geometry. :172-181.
da Fonseca GD, Mount D.  2010.  Approximate range searching: The absolute model. Computational Geometry. 43(4):434-444.
Cole R, Vishkin U.  1986.  Approximate scheduling, exact scheduling, and applications to parallel algorithms. Proceedings Symposium on Foundations of Computer Science. :478-491.
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.
Auer P, Long PM, Srinivasan A.  1997.  Approximating hyper-rectangles: learning and pseudo-random sets. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :314-323.
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.
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.
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.

Pages