Microsoft Research

Microsoft Research – 6 сентября 2016, 16:48

Achieving complex results through engineering simplicity.

Microsoft Research – 6 сентября 2016, 16:47

We are excited to announce that the 2001 Noble Laureate Professor for Physics, Professor Carl Wieman, will be visiting campus next Thursday, November 15th and will share details of his current work

We present a library of generic software components for parallel and distributed computations on graphs, based on the Boost Graph Library (BGL).

Multi-core systems such as IBM's Cell, Intel's Core 2 Duo and AMD's Barcelona are becoming ubiquitous.

Computer Go is one of the ultimate challenges for games research.

Schematic tables are a new representation for conditionals. Roughly a cross between decision tables and data flow graphs, they represent computation and decision-making orthogonally.

Thread-modular verification à la Flanagan and Qadeer is a promising approach for avoiding the state explosion during the verification of concurrent programs.

Despite their popularity and importance, pointer-based programs with linked data structures remain a major challenge for program verification.

Microsoft Research – 6 сентября 2016, 16:46

This talk introduces GENI, the National Science Foundation's ambitious plan to build a national facility to enable research into clean

Improving the energy efficiency of enterprise computing requires new ways of designing systems and new policies for adaptively managing individual systems or data centers.

In this talk we present a model that combines explicit and symbolic representations in an explicit-symbolic model checking tool.

While the public and the media have been distracted by the story of Napster, warnings about the evils of ΓÇ£piracyΓÇ¥ and lawsuits by the recording and film industries, the enforcement of copyright

An architectural-level, full-system simulator such as Virtutech Simics is a powerful and versatile research enabler for both architectural exploration and advanced OS/compiler development.

A result of Benjamini and Schramm states that the weak local limit (a.k.a. Benjamini-Schramm limit) of a sequence of planar graphs with uniformly bounded degrees is a.s. recurrent.

I will sing praises for the power of lazy languages, notably Haskell, to express operations on infinite data structures, and will use power-series algorithms as a prime example.

Disorders in voice are common and presently have been increasing due to unhealthy habits and vocal abuse.

Over the past few years, the notion of stability in data clustering algorithms has received growing attention among practitioners as a useful validation tool in a sample-based framework.

The transition to multicore is effectively a gamble that application programmers will start writing all of their code in parallel, or that workloads will change to make it simple to generate many

Understanding Gibbs measures on trees and their spatial mixing thresholds (uniqueness, strong spatial mixing, reconstruction) can give insight into the behavior of Gibbs measures on general graphs

Despite the best efforts of programmers, programs still ship with bugs.  Many of these bugs manifest as anomalies the heap.  This talk discusses two low-overhead synergistic techniques for

Microsoft Research – 6 сентября 2016, 16:43

Welcome to the mind and world of Fake Steve Jobs: Fake Steve, the counter-intuitive management guru: Obviously

I've spent the last ten years trying to feed technologies and insights from Linguistics and Computational Linguistics into the infrastructure of the Web.

Many students from developing countries dream about working for a place like Microsoft. Unfortunately, even basic education can be hard to attain when families are in poverty.

Leakage power has become an increasingly important issue in processor hardware and software design.

In this talk, we tackle a fundamental problem that arises when using sensors to monitor the ecological condition of rivers and lakes, the network of pipes that bring water to our taps, or the

We consider the following two problems: a) How can we best compare two graphs? and b) How can we compare two nodes in a given graph?