Microsoft Research

Systems that present people with information inescapably make editorial judgments in determining what information to show and how to show it.

The size-change abstraction (SCA) is an important program abstraction for termination analysis, which has been successfully implemented in many tools for functional and logic programs.

In this talk, we present a new mobile platform to support emerging context-aware applications in a dynamic mobile computing environment.

In studying how to communicate over a public channel with an active adversary, Dodis and Wichs introduced the notion of a non-malleable extractor.

Distributed memory clusters dominate the Top500 list, providing unprecedented computing power and generating massive datasets.

ABSTRACT: A typical learning process begins with some prior beliefs about the target concept. These beliefs are refined using evidence, typically a sample.

Today�s software is large and complex, with systems consisting of millions of lines of code.

Semi-supervised learning is a class of machine learning techniques that aims to use unlabeled data to improve the performance of models trained by labeled data only.

Our original work on the Code Bubbles programming environment demonstrated that the idea of a working-set based framework for software development had a lot of promise.

Over the years, wireless networks have been widely applied to offer ubiquitous and inexpensive Internet access within a wide coverage.

An emerging generation of artists is creating new forms of interactive experience that combine real and virtual worlds, and digital content with live action.

Microsoft Research – 27 июля 2016, 23:00

The objective is to estimate seasonal snow volumes, relative to historical trends and extremes, in snow-dominated mountains that have austere infrastructure, sparse gauging, challenges of

Cellular automata display an extraordinary range of behavior, ranging from very simple to apparently chaotic, with many cases in between.

Fix a (small) integer k and let G be a graph. For every set of k vertices in G we consider the subgraph induced by it. This distribution on k-vertex graphs is called the k-profile of G.

The talk will describe a model of planar aggregation which exhibits the widely-observed phenomenon of the growth of fingers, but which is simple enough that we can establish analytically, in the

Computer science is one of the richest, most exciting disciplines on the planet, yet any teenager will tell you that ICT (as it is called in UK schools – “information and communication technology”)

Logged messages are invaluable for debugging and diagnosing problems. Unfortunately, many execution logs are inscrutable in their raw form.

Modern web applications are frequently built using object-relational mapping (ORM) frameworks.

Submodular functions capture the law of diminishing returns and can be viewed as a generalization of convexity to functions over the Boolean cube.

Interactive surfaces, tangible interfaces, the web, cloud computing, and computationally mediated architectural spaces have long experienced vibrant activity in research and production contexts.

Despite the great progress made in artificial intelligence, we are still far from having a natural interaction between man and machine, because the machine does not understand the emotional state of

The cloud offers unprecedented access to computation. However, if the underlying cloud may be malicious, ensuring the privacy and reliability of that computation remains a significant challenge.

James Cheney, Sam Lindley, Philip Wadler. Draft paper, 1 December 2012, revised 29 March 2013.

Are quantum computers more powerful than classical computers? To answer this question one must know the classical computational complexity.

As a powerful new result we present a new technique to split the edges or vertices of any graph into k pieces such that contracting or deleting any piece results in a graph of bounded treewidth.

Separation logic (SL) has gained widespread popularity because of its ability to succinctly express complex invariants of a program’s heap configurations.

We analyze large random two-sided matching markets with different numbers of men and women.

Sensors acquire an increasing amount of diverse information posing two challenges.

A fundamental tradeoff in cloud computing lies between workload consolidation and performance.