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

Continuous Distributed Counting for Non-monotonic Streams

, Bozidar Radunovic, Milan Vojnovic

MSR-TR-2011-128 | November 2011

Publication

How to Write a 21st Century Proof

Journal of Fixed Point Theory and Applications | November 2011

Publication

A fully automated image analysis framework for quantitative assessment of temporal tumor changes

Dimitra Emmanouilidou

E-Health and Bioengineering Conference | November 2011

Publication

Rank-Pairing Heaps

Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan

SIAM Journal on Computing | November 2011, Vol 40(6)

23 pages

Publication

Shining Bright: The Golden Era of Signal Processing

Li Deng

IEEE Signal Processing Magazine | November 2011

Publication

Parallel Homomorphic Encryption

Seny Kamara, Mariana Raykova

MSR-TR-2011-120 | November 2011

Publication

Bargaining Dynamics in Exchange Networks

Mohsen Bayati, Christian Borgs, Jennifer Chayes, Yashodhan Kanoria, Andrea Montanari

November 2011

Publication

Polynomial Length MDS Codes With Optimal Repair in Distributed Storage

Viveck R. Cadambe, Cheng Huang, Jin Li, Sanjeev Mehrotra

Asilomar Conference on Signals, Systems, and Computers | November 2011

Publication

Non-conjugate Variational Message Passing for Multinomial and Binary Regression

David A. Knowles, Tom Minka

Advances in Neural Information Processing Systems 24 | October 2011

Video

Tradeoffs Between Fundamental Complexity Measures of Propositional Proofs

October 26, 2011 | Eli Ben-Sasson

What kind of theorems are easy to state yet hard to prove? This question motivates the study of propositional proof complexity. In this introductory talk I will describe the three fundamental proof-complexity measures of proof…

a man looking at the camera

Your Privacy Choices