illustration of intersecting lines with various shapes at the connecting points signifying algorithms on a green gradient background

Algorithms

Current selections

Sort by: Most recent

Clear selections

Publication

Prior-Independent Multi-parameter Mechanism Design

Nikhil Devanur, Jason D. Hartline, Anna R. Karlin, C. Thach Nguyen

7th International Workshop, WINE 2011, Singapore, December 11-14, 2011. Proceedings | January 2011

Publication

Correlated-Input Secure Hash Functions

Vipul Goyal, Adam O’Neill, Vanishree Rao

Theory of Cryptography. TCC 2011. Lecture Notes in Computer Science | January 2011

Publication

Streaming Algorithms via Precision Sampling

Alexandr Andoni, Robert Krauthgamer, Krzysztof Onak

Symposium on Foundations of Computer Science (FOCS) | January 2011

Publication

Path selection and multipath congestion control

Peter Key, Laurent Massoulie, Don Towsley

Communications of the ACM | January 2011

doi>10.1145/1866739.1866762

Publication

Symbolic Tree Transducers

Margus Veanes, Nikolaj Bjørner

Ershov Informatics Conference (PSI’11) | January 2011

Publication

Graph Partitioning with Natural Cuts

Daniel Delling, Andrew Goldberg, Ilya Razenshteyn, Renato Werneck

25th International Parallel and Distributed Processing Symposium (IPDPS’11) | January 2011

Publication

Multi-Bandit Best Arm Identification

Victor Gabillon, Mohammad Ghavamzadeh, Alessandro Lazaric, Sébastien Bubeck

NIPS | January 2011

Publication

Maximum Flows by Incremental Breadth-First Search

Andrew Goldberg, Sagi Hed, Haim Kaplan, Robert E. Tarjan, Renato Werneck

19th European Symposium on Algorithms (ESA 2011) | January 2011

19th European Symposium on Algorithms (ESA 2011)

Publication

Efficient algorithms for some special cases of the polynomial equivalence problem

Symposium on Discrete Algorithms (SODA) | January 2011

Video

M. Pawan Kumar – Self-Paced Learning for Specific-Class Semantic Segmentation

December 16, 2010 | Ashwani Sharma

Algorithms for learning the parameters of latent variable models are prone to getting stuck in a bad local optimum. To alleviate this problem, we build on the intuition that the algorithm should be presented with…

Your Privacy Choices