Publications
Export 896 results:
[ Author
] Title Type Year Filters: First Letter Of Last Name is S [Clear All Filters]
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.
2010. GPUML: Graphical processors for speeding up kernel machines. Workshop on High Performance Analytics-Algorithms, Implementations, and Applications.
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.
2011. Kernelized Renyi distance for subset selection and similarity scoring. Technical Reports of the Computer Science Department.
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.
2008. Improved algorithmic versions of the Lovász Local Lemma. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms. :611-620.
2001. New approaches to covering and packing problems. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :567-576.
2008. A note on the distribution of the number of prime factors of the integers. Information Processing Letters. 109(2):133-135.
2000. The value of strong inapproximability results for clique. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :144-152.
2010. Random sampling for estimating the performance of fast summations. Technical Reports of the Computer Science Department.
2001. Distributions on level-sets with applications to approximation algorithms. 42nd IEEE Symposium on Foundations of Computer Science, 2001. Proceedings. :588-597.
1995. Improved approximations of packing and covering problems. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :268-276.
2007. Randomized Algorithms and Probabilistic Analysis in Wireless Networking. Stochastic Algorithms: Foundations and ApplicationsStochastic Algorithms: Foundations and Applications. 4665:54-57.
1999. Approximation algorithms via randomized rounding: a survey. Lectures on Approximation and Randomized Algorithms (M. Karonski and HJ Promel, editors), Series in Advanced Topics in Mathematics, Polish Scientific Publishers PWN. :9-71.
2000. Low-discrepancy sets for high-dimensional rectangles: a survey. Bulletin of the EATCS. 70:67-76.
2011. Kernel partial least squares for speaker recognition. Twelfth Annual Conference of the International Speech Communication Association.
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.
2007. Approximation algorithms for stochastic and risk-averse optimization. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms. :1305-1313.
2010. Fast matrix-vector product based fgmres for kernel machines. Copper Mountain Conference on Iterative Methods. 2
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.