Publications
Export 7148 results:
[ Author
] Title Type Year Filters: Block-preconditioners-discrete-incompressible-navier%E2%80%93stokes-equations is [Clear All Filters]
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. 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. 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.
2010. GPUML: Graphical processors for speeding up kernel machines. Workshop on High Performance Analytics-Algorithms, Implementations, and Applications.
2000. Low-discrepancy sets for high-dimensional rectangles: a survey. Bulletin of the EATCS. 70:67-76.
2003. On the approximability of clique and related maximization problems. Journal of Computer and System Sciences. 67(3):633-651.
2000. The value of strong inapproximability results for clique. Proceedings of the thirty-second annual ACM symposium on Theory of computing. :144-152.
2011. A partial least squares framework for speaker recognition. Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on. :5276-5279.
2007. Randomized Algorithms and Probabilistic Analysis in Wireless Networking. Stochastic Algorithms: Foundations and ApplicationsStochastic Algorithms: Foundations and Applications. 4665:54-57.
1995. Improved approximations of packing and covering problems. Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. :268-276.
2009. Efficient subset selection via the kernelized Rényi distance. Computer Vision, 2009 IEEE 12th International Conference on. :1081-1088.
2001. New approaches to covering and packing problems. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :567-576.
1993. Techniques for probabilistic analysis and randomness-efficient computation. Computer Science Technical Reports, Cornell University.
2011. Kernel partial least squares for speaker recognition. Twelfth Annual Conference of the International Speech Communication Association.
1994. Computing with very weak random sources. , 35th Annual Symposium on Foundations of Computer Science, 1994 Proceedings. :264-275.
2001. Domatic partitions and the Lovász local lemma. Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. :922-923.
2010. Partial least squares on graphical processor for efficient pattern recognition. Technical Reports of the Computer Science Department.
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. Local Balancing Influences Global Structure in Social Networks. Proceedings of the National Academy of SciencesPNAS. 108(5):1751-1752.
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.
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.
2008. Improved algorithmic versions of the Lovász Local Lemma. Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms. :611-620.