Microsoft Research

The dynamical system in the repeated play of a game is uncoupled if each player initially knows only his own payoff function.

Let f be a fixed cusp form of weight at least 2. We show that for a set of n of density one, there is a common factor between n and the n-th Fourier coefficient of f.

Let C_1 denote the largest connected component of the critical Erdos-Renyi random graph G(n,1/n).

In thirty years of negotiation work, William Ury has learned that the most essential skill in negotiating and resolving conflicts is the one the vast majority of us have the most difficulty

Modern software engineering tools exhibit a fundamental paradox: they are meant to support the collaborative activity of software development, but cause individuals and groups to work independently

Occasionally the office of the CTO, David Vaskevitch, sits down with some of Microsoft's most influential technical employees to capture their stories.

Concurrency libraries can facilitate the development of multi-threaded programs by providing concurrent implementations of familiar data types such as queues or sets.

The talk will focus on the different legal issues involved in ascertaining whether those whose business is based on the exploitation of P2P enabling software should bear liability for copyright

Part 1: The

Brendan will come and talk about this design process, show a lot of demos of his work, and be available for questions.

Prof. Daniel D. Giusto, University of Cagliari: the Multimedia Communications Lab (10min) Prof.

Over the last decade, advances in natural language processing technologies have paved the way for the emergence of complex spoken language interfaces.

Coloring a $k$-colorable graph using $k$ colors ($k\geq 3$) is a notoriously hard problem. Considering average case analysis allows for better results.

We describe the process of using ArtiSynth, a 3D biomechanical simulation platform, to build models of the vocal tract and upper airway which are capable of simulating speech sounds.  ArtiSynth

Mark Johnson (Joint work with Sharon Goldwater and Tom Griffiths) Even though Maximum Likelihood Estimation (MLE) of Probabilistic Context-Free Grammars (PCFGs) is well-understood (the

Unique games are constraint satisfaction problems that can be viewed as a generalization of MAX CUT to a larger domain: We are given a graph G = (V,E) on n vertices and a permutation P_{uv} on the

Microsoft Research – 7 сентября 2016, 16:51

This talk presents a new design perspective of time-based interactivity and expression, which Lee calls Storied

An evolutionarily stable strategy (ESS) is an equilibrium strategy that is immune to invasions by rare alternative (mutant) strategies. Unlike Nash equilibria, ESS do not always exist in finite games.

We have all been to websites that welcome us by name, offering us discounts, deals or special access to content.

Model-based design encourages architects to use customized architectural languages that precisely target their problem domains.

Change or die. What if you were given that choice? What if it werenΓÇÖt just the hyperbolic rhetoric that conflates corporate performance with life or death?

Like the Greeks who sailed with Jason in search of the Golden Fleece, the new Argonauts-foreign born, technically skilled entrepreneurs who travel back and forth between Silicon Valley and their

Why is software so hard? Our civilization runs on software, yet the art of creating it continues to be a dark mystery, even to the experts, and the greater the ambitions, the more it seem to fail.

A classical approach of constructing elliptic curves that can be used for cryptographic purposes relies on the theory of complex multiplication.

The most widely used concurrent software techniques, which are based on threads, monitors (or approximations to monitors), and semaphores, yield incomprehensible and untestable software.

The Markov Chain Monte Carlo method is arguably the most powerful algorithmic tool available for approximate counting problems.

An elliptic divisibility sequence is an integer recurrence sequence related to the multiples of a rational point on an elliptic curve.

Attribute data and relationship data are two principle types of data, representing the intrinsic and extrinsic properties of entities.

In this work we show how to deterministically extract high quality randomness from several independent sources of low quality randomness.