Microsoft Research

We study the computational complexity of differentially private data release for simple, natural queries.

The talk will present some of the algorithms developed as part of my graduate work at Carnegie Mellon.

Online reviews are often unstructured.

Khot's Unique Games Conjecture (UGC) is one of the most central open problems in computational complexity theory.

One-way functions are the most basic, unstructured form of cryptographic hardness.

We are at an especially opportune time in the history of the study of human cognition. Brain imaging technology allows us to directly observe brain activity associated with cognitive processes.

In this talk I will cover the results of my recent PhD work on Software Process Recovery: the recovery of software development processes from evidence that developers leave behind.

Last summer we offered a one week ΓÇ£Computer Art and ProgrammingΓÇ¥ class to 7th (going on) 8th grade girls. It was a first introduction to programming for all the girls. It was a blast!

Going cross-platform with F# MonoDevelop plugin - Tomas Petricek F# from the Mac User's Perspective - Joe Pamer TryFSharp in a Browser - Dean Guo

In this talk I will describe how to do Sage development, which will help you be more prepared for the coding sprints.

Data collection technology is undergoing a revolution that is enabling streaming acquisition of real-time information in a wide variety of settings.

In recent years photo sharing web sites like Flickr have become increasingly popular. Nowadays, every day millions of photos are uploaded.

I will discuss the merits of an algorithmic approach to the analysis of complex self-organizing systems.

Given a collection of vertices in a network, the problem of finding the minimum cost sub-network connecting a set of client nodes to a dedicated hub-node is the Steiner tree problem.

As a community, storage systems practitioners are just beginning to scratch the surface with regard to leveraging all that erasure codes have to offer.

Modern software is fraught with bugs that allow hackers to overtake and control computing systems.

Can we make accessibility cheap and easy while not trivializing it or watering it down? Can we convince engineers, designers and decision makers to see the innovative potential in inclusive design?

Technology forecasts indicate that device scaling will continue well into the next decade.

The execution model of virtual machine-based languages are ideally suited for dynamic optimizations at run time.

This talk will report on ongoing work with Barry Mazur that studies 2-Selmer ranks in the family of all quadratic twists of a fixed elliptic curve over a number field.

The human brain contains 50 billion neurons with trillions of synaptic connections that allow sensory and motor systems to acquire and integrate many different forms of information.

Targeted advertising, including behavioral adverting, collects data about an individualΓÇÖs online activities for use in selecting which advertisement to display.

I will show by way of three separate illustrations my work on my long term project of reconceiving machine learning.

I will present a retrospective of aspects of my thesis, in light of applications in the last 14 years since its birth.

Performance scalability is a key requirement for many interactive and real-time applications, such as autonomous robot, autonomous driving, virtual reality, physics simulation, and nuclear power

We consider network contribution games, where each agent in a social network has a budget of effort that it can contribute to different collaborative projects or relationships.

Many patients with paralyzing injuries or medical conditions retain the use of their cranial nerves, which control the eyes, jaw, and tongue.

This presentation has two parts. The first half discusses the major factorization algorithms when ECM was discovered in 1985, stressing the similarities between ECM and P +- 1.

Graph-based dependency parsing finds direct syntactic relationships between words in a sentence by connecting head-modifier pairs into a tree structure.

ECC2K-130 is the smallest unsolved Certicom discrete-logarithm challenge. Certicom originally stated that breaking ECC2K-130 was 'infeasible' and would require 2700000000 machine days.