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 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 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, Chesire M, Berryman M, Sahasranaman V, Anderson T, Bershad B.  2000.  Receiver based management of low bandwidth access links. IEEE INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. 1:245-254vol.1-245-254vol.1.
Spring N, Mahajan R, Wetherall D.  2002.  Measuring ISP topologies with Rocketfuel. ACM SIGCOMM Computer Communication Review. 32:133-145.
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.
Spring N, Wolski R.  1998.  Application level scheduling of gene sequence comparison on metacomputers. Proceedings of the 12th international conference on Supercomputing. :141-148.
Spring N, Peterson L, Bavier A, Pait V.  2006.  Using PlanetLab for network research. ACM SIGOPS Operating Systems Review. 40:17-17.
Spring N, Mahajan R, Anderson T.  2003.  Quantifying the causes of path inflation. Topology. 100:2-1.
Spring N, Wetherall D.  2000.  A protocol-independent technique for eliminating redundant network traffic. ACM SIGCOMM Computer Communication Review. 30(4):87-95.
Spivey G, Bhattacharyya SS, Nakajima K.  2003.  Logic foundry: rapid prototyping for FPGA-based DSP systems. EURASIP J. Appl. Signal Process.. 2003:565-579.
Spivey G, Bhattacharyya SS, Nakajima K.  2002.  A component architecture for FPGA-based, DSP system design. Application-Specific Systems, Architectures and Processors, 2002. Proceedings. The IEEE International Conference on. :41-51.
Spetsakis M, Aloimonos Y.  1990.  A Unified Theory Of Structure From Motion. Proceedings of DARPA Image Understanding Workshop. :271-283.
Spetsakis M, Aloimonos Y.  1991.  A multi-frame approach to visual motion perception. International Journal of Computer Vision. 6(3):245-255.
Spetsakis ME, Aloimonos Y.  1989.  Optimal motion estimation. Workshop on Visual Motion, 1989.,Proceedings. :229-237.

Pages