Publications
Export 896 results:
[ Author] Title Type Year Filters: First Letter Of Last Name is S [Clear All Filters]
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.
1995. Improved approximation guarantees for packing and covering integer programs. DIMACS Technical Report.
2003. On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.
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.
2011. Kernel partial least squares for speaker recognition. Twelfth Annual Conference of the International Speech Communication Association.
2001. Domatic partitions and the Lovász local lemma. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :922-923.
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.
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.
2010. Fast matrix-vector product based fgmres for kernel machines. Copper Mountain Conference on Iterative Methods. 2
2008. Improved algorithmic versions of the Lovász Local Lemma. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms. :611-620.
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.
2003. Scriptroute: A public Internet measurement facility. Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems-Volume 4. :17-17.
1998. Application level scheduling of gene sequence comparison on metacomputers. Proceedings of the 12th international conference on Supercomputing. :141-148.
2000. A protocol-independent technique for eliminating redundant network traffic. ACM SIGCOMM Computer Communication Review. 30(4):87-95.
2002. Measuring ISP topologies with Rocketfuel. ACM SIGCOMM Computer Communication Review. 32:133-145.
2003. Logic foundry: rapid prototyping for FPGA-based DSP systems. EURASIP J. Appl. Signal Process.. 2003:565-579.
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.
1988. Optimal Computing Of Structure From Motion Using Point Correspondences In Two Frames. Proceedings of Second International Conference on Computer Vision. :449-453.
1990. Structure from motion using line correspondences. International Journal of Computer VisionInt J Comput Vision. 4(3):171-183.
1987. Spatiotemporal blur paths for image flow estimation (A). Journal of the Optical Society of America A. 4:35-35.