Publications

Export 7148 results:
[ Author(Asc)] 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 
S
Srinivasan BV, Garcia-Romero D, Zotkin DN, Duraiswami R.  2011.  Kernel partial least squares for speaker recognition. Twelfth Annual Conference of the International Speech Communication Association.
Srinivasan A, Teo C-P.  1997.  A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :636-643.
Srinivasan A.  2010.  Concentration of measure for the analysis of randomized algorithms by Devdatt P. Dubhashi and Alessandro Panconesi Cambridge University Press, 2009. SIGACT News. 41(1):28-30.
Srinivasan A.  1995.  Improved approximations of packing and covering problems. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :268-276.
Srinivasan A.  1997.  Scheduling and load-balancing via randomization. TR11/97
Srinivasan A, Ramakrishnan KG, Kumaran K, Aravamudan M, Naqvi S.  2000.  Optimal design of signaling networks for Internet telephony. IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. 2:707-716vol.2-707-716vol.2.
Srinivasan BV, Duraiswami R.  2009.  Scaling kernel machine learning algorithm via the use of GPUs. GPU Technology Conference.
Srinivasan BV, Zotkin DN, Duraiswami R.  2011.  Partial least squares based speaker recognition system. Snowbird Learning Workshop.
Srinivasan A, Zuckerman D.  1994.  Computing with very weak random sources. , 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings. :264-275.
Srinivasan A.  2001.  Domatic partitions and the Lovász local lemma. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :922-923.
Srinivasan B V, Duraiswami R.  2011.  Kernelized Renyi distance for subset selection and similarity scoring. Technical Reports of the Computer Science Department.
Srinivasan A.  1997.  Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. , 38th Annual Symposium on Foundations of Computer Science, 1997. Proceedings. :416-425.
Srinivasan B V, Duraiswami R.  2010.  Random sampling for estimating the performance of fast summations. Technical Reports of the Computer Science Department.
Srinivasan A.  2011.  Local Balancing Influences Global Structure in Social Networks. Proceedings of the National Academy of SciencesPNAS. 108(5):1751-1752.
Srinivasan A.  1999.  A survey of the role of multicommodity flow and randomization in network design and routing. American Mathematical Society, Series in Discrete Mathematics and Theoretical Computer Science. 43:271-302.
Srinivasan BV, Duraiswami R, Gumerov NA.  2010.  Fast matrix-vector product based fgmres for kernel machines. Copper Mountain Conference on Iterative Methods. 2
Srinivasan A.  2008.  Improved algorithmic versions of the Lovász Local Lemma. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms. :611-620.
Srinivasan A.  2001.  Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
Srinivasan A.  2007.  Approximation algorithms for stochastic and risk-averse optimization. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. :1305-1313.
Srinivasan A.  1999.  Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM Journal on Computing. 29(2):648-648.
Srinivasan A.  2006.  Review of "The Random Projection Method by Santosh Vempala". SIGACT News. 37(4):41-43.
Srinivasan A.  2008.  A note on the distribution of the number of prime factors of the integers. Information Processing Letters. 109(2):133-135.
Srinivasan B V, Schwartz W R, Duraiswami R, Davis LS.  2010.  Partial least squares on graphical processor for efficient pattern recognition. Technical Reports of the Computer Science Department.
Spring N, Peterson L, Bavier A, Pait V.  2006.  Using PlanetLab for network research. ACM SIGOPS Operating Systems Review. 40:17-17.
Spring N, Wetherall D, Anderson T.  2003.  Scriptroute: A public Internet measurement facility. Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems-Volume 4. :17-17.

Pages