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
Stantchev G, Juba D, Dorland W, Varshney A.  2007.  Plasma Turbulence Simulation and Visualization on Graphics Processors: Efficient Parallel Computing on the Desktop. Bulletin of the American Physical Society. Volume 52, Number 11
Stamps BW, Leddy MB, Plumlee MH, Hasan NA, Colwell RR, Spear JR.  2018.  Characterization of the Microbiome at the World’s Largest Potable Water Reuse Facility. Frontiers in Microbiology.
Stallmann M, Cleaveland R, Hebbar P.  1991.  Gdr: A visualization tool for graph algorithms.
Srivastava A, Damon JN, Dryden IL, Jermyn IH, Das S, Vaswani N, Huckemann S, Hotz T, Munk A, Lin Z et al..  2010.  SPECIAL SECTION ON SHAPE ANALYSIS AND ITS APPLICATIONS IN IMAGE UNDERSTANDING. IEEE Transactions on Pattern Analysis and Machine Intelligence. 32(4):0162-8828.
Srivastava S, Hicks MW, Foster JS.  2007.  Appendix to CMod: Modular Information Hiding and Type-Safe Linking for C. Technical Reports of the Computer Science Department.
Srivastava S, Hicks MW, Foster JS, Jenkins P.  2008.  Modular Information Hiding and Type-Safe Linking for C. IEEE Transactions on Software Engineering. 34(3):357-376.
Srivastava S, Gulwani S, Foster JS.  2010.  From program verification to program synthesis. ACM SIGPLAN Notices. 45:313-326.
Sriram S, Bhattacharyya SS.  2000.  Embedded multiprocessors: Scheduling and synchronization. 3
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, 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 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 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.  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 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 B V, Duraiswami R.  2011.  Kernelized Renyi distance for subset selection and similarity scoring. Technical Reports of the Computer Science Department.
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 B V, Duraiswami R.  2010.  Random sampling for estimating the performance of fast summations. Technical Reports of the Computer Science Department.
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 BV, Duraiswami R, Gumerov NA.  2010.  Fast matrix-vector product based fgmres for kernel machines. Copper Mountain Conference on Iterative Methods. 2
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.

Pages