Microsoft Brings World’s Fastest Texting to Windows Phone 8.1
Gaurav Sharma appeared relaxed but focused in his purple hoodie on January 16, 2014. Less than 20 seconds later, Sharma, a 15-year-old from Lakeside High School in Seattle, found himself the owner of a Guinness…
Provable Non-convex Optimization for Machine Learning Problems
We explore theoretical properties of simple non-convex optimization methods for problems that feature prominently in several important areas such as recommendation systems, compressive sensing, computer vision etc.
Regret in Online Combinatorial Optimization
Candidate Multilinear Maps
I will describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups. These new constructions radically enhance our tool set and open a floodgate of applications. I will present some…
An Overview of Lattice Reduction Algorithms
The best generic tool currently known for attacking lattice-based cryptographic primitives is lattice reduction. Lattice reduction is a representation paradigm: it consists in finding a representation (a basis) of a given lattice that provides easier…