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.  1999.  Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM Journal on Computing. 29(2):648-648.
Srinivasan BV, Duraiswami R.  2009.  Scaling kernel machine learning algorithm via the use of GPUs. GPU Technology Conference.
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.  Partial least squares based speaker recognition system. Snowbird Learning Workshop.
Srinivasan B V, Duraiswami R.  2011.  Kernelized Renyi distance for subset selection and similarity scoring. Technical Reports of the Computer Science Department.
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 B V, Duraiswami R.  2010.  Random sampling for estimating the performance of fast summations. Technical Reports of the Computer Science Department.
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.  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.  2003.  On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.
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.
Sriram S, Bhattacharyya SS.  2000.  Embedded multiprocessors: Scheduling and synchronization. 3
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, Jenkins P.  2008.  Modular Information Hiding and Type-Safe Linking for C. IEEE Transactions on Software Engineering. 34(3):357-376.
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, Gulwani S, Foster JS.  2010.  From program verification to program synthesis. ACM SIGPLAN Notices. 45:313-326.
Stallmann M, Cleaveland R, Hebbar P.  1991.  Gdr: A visualization tool for graph algorithms.
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.
Stantchev G, Juba D, Dorland W, Varshney A.  2009.  Using Graphics Processors for High-Performance Computation and Visualization of Plasma Turbulence. Computing in Science Engineering. 11(2):52-59.
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
Stantchev G, Juba D, Dorland W, Varshney A.  2008.  Confluent Volumetric Visualization of Gyrokinetic Turbulence. Plasma Science, IEEE Transactions on. 36(4):1112-1113.

Pages