Microsoft Research

A number of researchers have successfully applied techniques from combinatorial and algebraic topology to solve some long-standing open problems in distributed computing.

Many important synchronization problems in distributed computing are impossible to solve (in a fault-tolerant manner) in purely asynchronous systems, where message transmission delays or relative

Many Web-based commercial services deliver their content using Web applications that generate pages dynamically based on user profiles, request parameters etc.

I discuss stochastic simulation of the dynamics of biological networks, in particular those involved in gene regulation.

Network file systems offer a powerful, transparent interface for accessing remote data.

This talk describes the Scalable Hyperlink Store, a specialized database that gives very fast access to the forward and backward links of very large web graphs.

An ubiquitous problem in many areas like decision-making or engineering is to find correct values for a set of variables which are subject to some constraints.

The Internet is the fastest growing information medium of all time. Latest estimates [1] report the Internet size as 533,000 TB.

The Satisfiability problem (SAT) is the problem of assigning a value to a vector x in {0,1}ⁿ of boolean variables so that the falue of a function F(x)=∏_{i=1}^{m}C_{i}(x_{c_{i}})=1.

Abstract to follow

Abstract to follow

The presentation slide and the complete schedule of Dr. TLA+ Series are available at github.com/tlaplus/DrTLAPlus.

8:30-8:40 Welcome and Intros 8:40-9:00 The latest from Surface Hub - Dave Slobodin 9:00–9:30 The latest from MSR and demo intros: MSR NeXT + MSR Labs - Steven Drucker - Michel Pahud, MSR

Microsoft Research – 6 сентября 2016, 21:29

In this talk, we explore the use of Random Forests (RFs) in language modeling, the problem of predicting the next word based on words already seen.

Doppler radar data, which has proven its value in meteorology research, has tremendous potential for use in many other research endeavors if only it werenΓÇÖt so difficult to work with.

Workflow is an important enabling technology for eScience. Research into workflow systems for eScience has yielded several specialized workflow engines.

This session will provide an overview of the research agenda in computer science in Latin America and the overall regional organization and existing cooperation programs.

MIT iCampusΓÇöbased at the Massachusetts Institute of Technology (MIT), supported by Microsoft Corporation, conducted in collaboration with Microsoft ResearchΓÇöis a program that supports faculty

Microsoft Research – 6 сентября 2016, 21:26

In 1960 Paul Erdos and Alfred Renyi showed that the random graph G(n,p) with p=c/n and c>1 contained, with high probability, a giant

We investigate the complexity of exactly solving NP-hard optimization problems involving at most two variables per constraint, such as MAX-CUT, MAX-2-SAT, and MIN-BISECTION.

Several recent and fundamental advances have greatly increased the power of automated reasoning tools.

We consider the complexity of properly learning concept classes, i.e. when the learner must output a hypothesis of the same form as the unknown concept.

A family of sets is called intersecting if the intersection of every two sets in the family is non empty.

Let L(Q^t) denote the number of linear extensions of the t-dimensional Boolean lattice Q^t, for t>1. We use an entropy technique of J.

This is a report on joint work with Everett Howe and Kristin Lauter.

Your life is the creation of what you focus on-and what you donΓÇÖt. But what is ΓÇ£attentionΓÇ¥, exactly? Can we train our focus? What happens in the brain when you deeply focus on something?

Microsoft Research – 6 сентября 2016, 18:53

By now everyone knows that security must be built in to software; it cannot be bolted on.