Publications

Export 7148 results:
[ Author(Desc)] 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 A.  2006.  Review of "The Random Projection Method by Santosh Vempala". SIGACT News. 37(4):41-43.
Srinivasan A.  1999.  Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM Journal on Computing. 29(2):648-648.
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 BV, Zotkin DN, Duraiswami R.  2011.  A partial least squares framework for speaker recognition. Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on. :5276-5279.
Srinivasan BV, Duraiswami R.  2009.  Efficient subset selection via the kernelized Rényi distance. Computer Vision, 2009 IEEE 12th International Conference on. :1081-1088.
Srinivasan A.  1996.  An extension of the Lovász Local Lemma, and its applications to integer programming. Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms. :6-15.
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.  1995.  Improved approximation guarantees for packing and covering integer programs. DIMACS Technical Report.
Srinivasan A.  2000.  Low-discrepancy sets for high-dimensional rectangles: a survey. Bulletin of the EATCS. 70:67-76.
Srinivasan A.  1997.  Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems. Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms. :692-701.
Srinivasan A.  1992.  A Generalization of Brooks' Theorem. Computer Science Technical Reports.
Srinivasan A, Pandu Rangan C.  1991.  Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. Theoretical Computer Science. 91(1):1-21.
Srinivasan A.  2000.  The value of strong inapproximability results for clique. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :144-152.
Srinivasan A.  2003.  On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.
Srinivasan A.  1999.  Approximation algorithms via randomized rounding: a survey. Lectures on Approximation and Randomized Algorithms (M. Karonski and HJ Promel, editors), Series in Advanced Topics in Mathematics, Polish Scientific Publishers PWN. :9-71.
Srinivasan A.  2007.  Randomized Algorithms and Probabilistic Analysis in Wireless Networking. Stochastic Algorithms: Foundations and ApplicationsStochastic Algorithms: Foundations and Applications. 4665:54-57.
Srinivasan BV, Duraiswami R.  2009.  Scaling kernel machine learning algorithm via the use of GPUs. GPU Technology Conference.
Srinivasan A.  1993.  Techniques for probabilistic analysis and randomness-efficient computation. Computer Science Technical Reports, Cornell University.
Srinivasan A.  2001.  New approaches to covering and packing problems. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :567-576.
Srinivasan BV, Zotkin DN, Duraiswami R.  2011.  Partial least squares based speaker recognition system. Snowbird Learning Workshop.
Srinivasan A.  2008.  Budgeted Allocations in the Full-Information Setting. Approximation, Randomization and Combinatorial Optimization. Algorithms and TechniquesApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. 5171:247-253.
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, 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 B V, Duraiswami R.  2011.  Kernelized Renyi distance for subset selection and similarity scoring. Technical Reports of the Computer Science Department.
Srinivasan B V, Duraiswami R.  2010.  Random sampling for estimating the performance of fast summations. Technical Reports of the Computer Science Department.

Pages