Algorithms
Towards a Compositional Typed Semantics using Universal Dependencies
Universal Dependencies offer a homogeneous syntactic representation across languages fostering multilingual NLP research. However, dependency structures lack a transparent syntax-semantics interface like CCG, making it hard to derive target-application specific semantics in a synchronous compositional…
Dr. TLA+ Series – Fast Paxos
The presentation slide and the complete schedule of Dr. TLA+ Series are available at https://github.com/tlaplus/DrTLAPlus. Replicating data across geographically distributed data centers is the new norm in cloud services. Compared to Classic Paxos, Fast Paxos shines…
Summer school data science research could trigger real world changes
By John Kaiser, Writer, Microsoft Research Microsoft Research hosted its third annual Data Science Summer School in New York City as a diverse group of undergraduate students deployed some of the latest data crunching techniques…
Near-Optimal Robust Matrix Completion via Non-convex Optimization
Several important applications require completion a low-rank matrix in presence of gross outliers. Examples include robust PCA with missing entries, robust recommendation system, foreground background separation in sublinear time etc. Existing solutions for this problem…
Complexity Theory for MapReduce Algorithms
For many problems, algorithms implemented in MapReduce or similar two-ranks-of-parallel-tasks systems exhibit a tradeoff between memory size and communication. More precisely, the tradeoff is between “reducer size” (the number of inputs received by the second…
End of Internship Talks
End for Internship talks given by: Perry Wang Title: “Low* and subset of F* that will compile down to C” Time : 10-10:45 Laure Thompson Title: “Spartan and proving implementations of cryptographic algorithms correct” Time…
