Microsoft Research

Did you hear the one about how many batteries it takes to turn on a Turing machine? None! It's outside the model of computation. Yet it's extremely difficult to compute without power.

Solving sequential decision problems under partial observability is a fundamental but notoriously difficult challenge.

We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects.

As data becomes increasingly prevalent, people can be easily overwhelmed by the flood of available information.

The ORCHID project at the Universities of Southampton, Oxford and Nottingham is addressing the challenge of building computational systems in which software agents and people interact.

In recognition of the leadership and achievements of Rick Rashid for his 60th birthday, this Festschrift colloquium celebrates his past and future contributions to our research.

The discovery of quantum error correction and fault-tolerance were major theoretical breakthroughs on the road towards building a full-fledged quantum computer.

Microsoft Research – 12 августа 2016, 0:03

4:10 to 4:25 Case Study Example ΓÇô Coastal Engineering Hans R.

In recognition of the leadership and achievements of Rick Rashid for his 60th birthday, this Festschrift colloquium celebrates his past and future contributions to our research.

In recognition of the leadership and achievements of Rick Rashid for his 60th birthday, this Festschrift colloquium celebrates his past and future contributions to our research.

2:05 to 2:45 Case Study Example ΓÇô Fisheries Peter Lawson, National Oceanic & Atmospheric Administration Joe Schumacker, Quinault Indian Nation This case study will detail the local fisheries use

In the last few years Massively Multiplayer Online Games (MMOGs) have become a popular class of distributed applications with millions of users.

8:30 to 10:30 New Collaborations At this meeting Microsoft Research will present details of projects they are undertaking which have relevance to the Integrated Ocean Observing System.

This talk begins with a quick overview of machine learning techniques we study for visual recognition.

In recognition of the leadership and achievements of Rick Rashid for his 60th birthday, this Festschrift colloquium celebrates his past and future contributions to our research.

Recent years have seen an explosive growth in personal digital media collections, yet post-capture this content frequently lies dormant on usersΓÇÖ PCs.

The dream of computer vision is to create a machine capable of human-level visual analysis.

Mechanism design can be described as designing algorithms for optimization problems where the input is privately known to selfish agents (i.e., the type of each agent); thus, to obtain an optimal

The unifying theme of my research is using visual data to extract mathematical representations of the 3d world.

A fundamental change to the requirements of operating system architecture is taking place as hardware designers move from speeding up individual processors to including ever more processing cores on

Modern cryptanalysis typically deal with basic cryptographic primitives where a vulnerability might imply an unavoidable threat to a full cryptosystem.

10:45 to 11:00 Why We Are Here David Martin, NANOOS Board Chair, Applied Physics Laboratory-University of Washington This presentation will provide an introduction to the importance of measurements

A basic primitive in graph optimization is that of finding small induced subgraphs of a given graph with ``many'' edges.

In this talk we will present approximation algorithms (and general techniques) for some basic problems in the field of stochastic optimization.

The birthday problem states that there is at least half a chance that some two out of twenty-three randomly chosen people will share the same birth date.

The past decade has seen the emergence of datasets of an unprecedented scale, with both large sample sizes and dimensionality.

The study of combinatorial problems with a submodular objective function has attracted much attention in recent years, and is partly motivated by the importance of such problems to economics

Microsoft Research – 11 августа 2016, 23:49

We present a deterministic (1+sqrt(5))/2-approximation algorithm for the s-t path TSP for an arbitrary metric.