Publications
Export 896 results:
[ Author] Title Type Year Filters: First Letter Of Last Name is S [Clear All Filters]
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.
2003. Scriptroute: A public Internet measurement facility. Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems-Volume 4. :17-17.
2000. A protocol-independent technique for eliminating redundant network traffic. ACM SIGCOMM Computer Communication Review. 30(4):87-95.
1998. Application level scheduling of gene sequence comparison on metacomputers. Proceedings of the 12th international conference on Supercomputing. :141-148.
2002. Measuring ISP topologies with Rocketfuel. ACM SIGCOMM Computer Communication Review. 32:133-145.
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.
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.
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.
2011. Kernel partial least squares for speaker recognition. Twelfth Annual Conference of the International Speech Communication Association.
2007. Approximation algorithms for stochastic and risk-averse optimization. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. :1305-1313.
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.
1993. Techniques for probabilistic analysis and randomness-efficient computation. Computer Science Technical Reports, Cornell University.
2010. Fast matrix-vector product based fgmres for kernel machines. Copper Mountain Conference on Iterative Methods. 2
1994. Computing with very weak random sources. , 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings. :264-275.
1999. Improved Approximation Guarantees for Packing and Covering Integer Programs. SIAM Journal on Computing. 29(2):648-648.
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.
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.
1991. Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs. Theoretical Computer Science. 91(1):1-21.
2011. Local Balancing Influences Global Structure in Social Networks. Proceedings of the National Academy of SciencesPNAS. 108(5):1751-1752.
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.