Algorithms - Microsoft Research

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…

01:11:25

Publication

Hierarchical Tag Visualization and Application for Tag Recommendations

Yang Song, Umer Farooq, Baojun Qiu

In Proceedings of the 20th ACM international conference on Information and knowledge management (CIKM ’11) | October 2011

Publication

BLR-D: Applying Bilinear Logistic Regression to Factored Diagnosis Problems

Sumit Basu, John Dunagan, Kevin Duh, Kiran-Kumar Muniswamy-Reddy

Operating Systems Review, December 2011. Also presented at the SLAML workshop at SOSP 2011. | October 2011

Publication

Correction of Teledyne Acoustic Doppler Current Profiler (ADCP) Bottom-Track Range Measurements for Instrument Pitch and Roll

Rebecca A. Woodgate, Alexander E. Holroyd

MSR-TR-2011-151 | October 2011

Publication

Stateless Cryptographic Protocols

Vipul Goyal, Hemanta K. Maji

Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on | October 2011