Publications

Search
Export 896 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is S  [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 
S
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.  1999.  Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM Journal on Computing. 29(2):648-648.
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.
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 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, Duraiswami R, Murtugudde R.  2010.  Efficient kriging for real-time spatio-temporal interpolation. Proceedings of the 20 th Conference on Probability and Statistics in the Atmospheric Sciences. :228-235.
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.  2011.  Local Balancing Influences Global Structure in Social Networks. Proceedings of the National Academy of SciencesPNAS. 108(5):1751-1752.
Srinivasan A.  1997.  Scheduling and load-balancing via randomization. TR11/97
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.  1995.  Improved approximation guarantees for packing and covering integer programs. DIMACS Technical Report.
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.  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, Hu Q, Duraiswami R.  2010.  GPUML: Graphical processors for speeding up kernel machines. Workshop on High Performance Analytics-Algorithms, Implementations, and Applications.
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 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.  2006.  Review of "The Random Projection Method by Santosh Vempala". SIGACT News. 37(4):41-43.
Srinivasan B V, Duraiswami R.  2011.  Kernelized Renyi distance for subset selection and similarity scoring. Technical Reports of the Computer Science Department.
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 BV, Duraiswami R.  2009.  Scaling kernel machine learning algorithm via the use of GPUs. GPU Technology Conference.
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.  New approaches to covering and packing problems. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :567-576.
Srinivasan A.  2008.  A note on the distribution of the number of prime factors of the integers. Information Processing Letters. 109(2):133-135.

Pages