Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Our research
Content type
+
Downloads (457)
+
Events (451)
 
Groups (152)
+
News (2759)
 
People (735)
 
Projects (1111)
+
Publications (12626)
+
Videos (5808)
Labs
Research areas
Algorithms and theory47205 (66)
Communication and collaboration47188 (63)
Computational linguistics47189 (11)
Computational sciences47190 (69)
Computer systems and networking47191 (128)
Computer vision208594 (23)
Data mining and data management208595 (11)
Economics and computation47192 (25)
Education47193 (84)
Gaming47194 (24)
Graphics and multimedia47195 (67)
Hardware and devices47196 (66)
Health and well-being47197 (32)
Human-computer interaction47198 (156)
Machine learning and intelligence47200 (94)
Mobile computing208596 (19)
Quantum computing208597 (18)
Search, information retrieval, and knowledge management47199 (62)
Security and privacy47202 (30)
Social media208598 (11)
Social sciences47203 (41)
Software development, programming principles, tools, and languages47204 (42)
Speech recognition, synthesis, and dialog systems208599 (10)
Technology for emerging markets208600 (6)
1–25 of 66
Sort
Show 25 | 50 | 100
123Next 
Improving the Halo 5 multiplayer experienceSenior researcher Rob DeLine describes how the Halo team uses Trill, a high-performance in-memory incremental analytics engine, and Tempe, a web service for exploratory data analysis, to monitor and quickly improve the Xbox gaming experience.​
Video details
Date: 18 June 2015
Duration: 00:02:48
Publisher: Microsoft
P: Safe Asynchronous Event-Driven ProgrammingP: a domain specific language for writing asynchronousevent-driven programs. This asynchronouslanguage promotes a discipline of programmingwhere deferrals need to be declared explicitly, and consequentlyleads to responsive systems.The main technicalcontribution of this work is an asynchronous model which forceseach event in the queue to be handled as soon as the machine associatedwith the queue is scheduled, and has a chance to de-queue theevent. The system's verifier systematically explores the state...
Video details
Date: 3 May 2015
Duration: 00:01:29
Publisher: Microsoft
The Solution of the Kadison-Singer ProblemThe Kadison-Singer problem is a question in operator theory whicharose in 1959 while trying to make Dirac's axioms for quantum mechanicsmathematically rigorous in the context of von Neumann algebras.A positive solution to the problem is given by Nikhil Srivastava by proving essentially the strongestpossible partitioning theorem of this type. The proof is based on two significantingredients: a new existence argument, which reduces the problem to boundingthe roots of the expected characteristic polynomials...
Video details
Date: 2 May 2015
Duration: 00:02:05
Publisher: Microsoft
Laci Lovasz
Automorphisms of GraphonsConvergent dense sequences of graphs and their limit objects called graphons were introduced by Borgs, Chayes, Lovasz, Sos, Szegedy and Vesztergombi. Many directions of study of finite graphs extend to the study of graphons, and often yield interesting, even surprising results. In this talk we discuss the automorphism group of graphons. We prove that after an appropriate “standardization” of the graphon, the automorphism group is compact. Furthermore, we characterize the orbits of the automorphism group on...
Video details
Date: 23 April 2015
Duration: 01:08:59
Jon Kleinberg
Long-Range Planning with Time-Inconsistency: A Class of Computational Problems in Behavioral EconomicsThere are many settings where people set long-range goals and make plans to achieve them. Such long-range planning is becoming an integral of the experience in many on-line contexts, where for example people work toward reputational milestones in question-answering sites, build up to administrative roles in open-source authoring domains, and reach educational goals in on-line learning communities.In order to understand these kinds of processes, we need to enrich our models with the types of human...
Video details
Date: 17 March 2015
Duration: 00:58:37
Horvitz: Competition in AI helps fuel innovationIn this excerpt from a Microsoft Research Luminaries interview, Eric Horvitz, Distinguished Scientist and Managing Director, Microsoft Research Redmond, is excited that competitive forces will accelerate advances in Artificial Intelligence.​
Video details
Date: 27 January 2015
Duration: 00:01:26
Publisher: Microsoft
Horvitz: ItIn this excerpt from a Microsoft Research Luminaries interview, Eric Horvitz, Distinguished Scientist and Managing Director, Microsoft Research Redmond, explains why it's important to pursue Artificial Intelligence.
Video details
Date: 27 January 2015
Duration: 00:01:13
Publisher: Microsoft
Konstantinos Vamvourellis talks about his stint at MSR IndiaKonstantinos is a PhD student in CSE at City University of New York. He is interested is research areas such as Cryptography and Privacy and worked with two groups at MSR India:Algorithms and Data SciencesCryptography and Complexity
Video details
Date: 15 September 2014
Duration: 00:01:39
Publisher: Microsoft
Dave Wecker
Languages, compilers, and computer-aided design tools will be essential for scalable quantum computing, which promises an exponential leap in our ability to execute complex tasks. LIQUi|> is a modular software architecture designed to control quantum hardware. It enables easy programming, compilation, and simulation of quantum algorithms and circuits, and is independent of a specific quantum architecture. LIQUi|> contains an embedded, domain-specific language designed for programming quantum...
Video details
Date: 29 May 2014
Duration: 00:45:00
Publisher: Microsoft
Get to know Microsoft ResearchA quick peek at what's new at Microsoft Research.
Video details
Date: 17 April 2014
Duration: 00:01:26
Publisher: Microsoft
Treasure HuntA presentation from the Games, Networks and Markets event held in Cambridge UK between 28-29 June 2012.
Video details
Date: 28 June 2012
Duration: 00:57:25
Publisher: Microsoft
Umesh Vazirani
Quantum Hamiltonian ComplexityWe consider three basic questions about quantum mechanics:Do `typical' quantum states that occur in Nature have succinct (polynomial) description?Can quantum systems at room temperature exhibit exponential complexity?Is the scientific method sufficiently powerful to comprehend general quantum systems?Each of these questions is best studied through a computational lens as a questionabout computation. The resulting questions lie at the core of theory. The first asks about the structure of solutions to the...
Video details
Date: 13 June 2012
Duration: 01:02:16
Oded Regev
Lattice-Based CryptographyWe will give a survey of recent work on lattice-based cryptography, mainly focusing on the so-called Learning with Errors (LWE) problem. This problem has turned out to be an amazingly versatile basis for cryptographic constructions, with tens of applications, including the recent celebrated work on fully homomorphic encryption. In addition to applications, we will also mention very recent work providing a better understanding of the security of the problem. The talk does not require any prior knowledge in...
Video details
Date: 6 June 2012
Duration: 01:11:24
Eran Shmaya
Expressible InspectionsA decision maker needs predictions about the realization of a repeated experi- ment in each period. An expert provides a theory that, conditional on each finite history of outcomes, supplies a probabilistic prediction about the next outcome. However, there may be false experts without any knowledge of the data-generating process who deliver theories strategically. Hence, empirical tests for predictions are necessary. A test is manipulable if a false expert can pass the test with a high probability. Like...
Video details
Date: 18 April 2012
Duration: 01:10:33
Machine Learning and Intelligence in Our MidstThe creation of intelligent computing systems that perceive, learn, and reason has been a long-standing and visionary goal in computer science. Over the last 20 years, technical and infrastructural developments have come together to create a nurturing environment for developing and fielding applications of machine learning and reasoning–and for harnessing machine intelligence to provide value to businesses and to people in the course of their daily lives. Key advances include jumps in the availability of...
Video details
Date: 6 March 2012
Duration: 00:51:57
Publisher: Microsoft
Jon Kleinberg
Which Networks Are Least Susceptible to Cascading Failures?The spread of a cascading failure through a network is an issue that comes up in many domains: in the contagious failures that spread among financial institutions during a financial crisis, through nodes of a power grid or communication network during a widespread outage, or through a human population during the outbreak of an epidemic disease. Here we study a natural model of threshold contagion: each node is assigned a numerical threshold drawn independently from an underlying distribution, and it will...
Video details
Date: 8 December 2011
Duration: 01:10:37
Jon Kleinberg
Computational Perspectives on Social Phenomena in On-Line NetworksWith an increasing amount of social interaction taking place in the digital domain, and often in public on-line settings, we are accumulating enormous amounts of data about phenomena that were once essentially invisible to us: the collective behavior and social interactions of hundreds of millions of people, recorded at unprecedented levels of scale and resolution. Analyzing this data computationally offers new insights into the design of on-line applications, as well as a new perspective on fundamental...
Video details
Date: 7 December 2011
Duration: 01:15:33
Irit Dinur
PCPs and Expander GraphsA probabilistically checkable proof (PCP) is a special format for writing proofs that is very robust. In this format, a proof of a false theorem is guaranteed to have so many bugs that it can be checked by reading a constant number of random proof bits. The celebrated PCP theorem says that every NP language has a robust 'PCP' proof.In the talk we will explain how to construct a PCP by taking any standard NP proof and then routing it through an expander graph (i.e., a graph that is very well-connected). We...
Video details
Date: 30 November 2011
Duration: 01:26:36
Eli Ben-Sasson
Tradeoffs Between Fundamental Complexity Measures of Propositional ProofsWhat kind of theorems are easy to state yet hard to prove?This question motivates the study of propositional proof complexity. In this introductory talk I will describe the three fundamental proof-complexity measures of proof length, width, and space. These measures correspond to different aspects of the “hardness” of proving a given theorem. Then I will discuss the surprising relationships between these three measures and conclude with accessible and intriguing open questions in this area.Based on joint...
Video details
Date: 26 October 2011
Duration: 01:11:25
Eitan Bachmat
On Queues and NumbersWe will consider the problem of managing a mini-market with! two checkout counters, one of them serving as an express lane. For many of the standard job size distributions such as the exponential distribution,the problem of managing the mini-market is rather nasty. However, for some distributions, the! management problem becomes very easy. We will provide some examples coming from the Taniyama-Shimura conjecture and explain the general connection between mini-market queues and number theory, coming from...
Video details
Date: 20 October 2011
Duration: 01:00:54
Programming LifeLife is a product of Living Software: programmable matter that orchestrates a range of remarkable functions, from the self-assembly of every organism on Earth, to the ability to recognise and fight pathogens, to creating intelligence, to powering the planet. If we could program life it would form the foundations for a revolution in medicine, energy and agriculture. And computing. Many challenges currently exist to programming life. We are pioneering techniques to overcome these challenges.
Video details
Date: 27 September 2011
Duration: 00:21:39
Collection: 20th Anniversary Lecture Series
Publisher: Microsoft
Video details
Date: 27 September 2011
Duration: 00:15:06
Collection: 20th Anniversary Lecture Series
Publisher: Microsoft
Communication, Computing, and TechnologyMadhu Sudan, principal researcher at Microsoft Research New England, discusses the differences between theoretical computation versus communication. “Communication,” in this context, refers to mobile phones, email, and other messages, while “computation” refers to things one does with a computer. These technologies are interdependent, and currently, one can no longer exist without the other. The contradiction lies in the practice where these technologies are being developed separately, creating missed...
Video details
Date: 27 September 2011
Duration: 00:09:20
Collection: 20th Anniversary Lecture Series
Publisher: Microsoft
Video details
Date: 27 September 2011
Duration: 00:28:59
Publisher: Microsoft
Welcome to Microsoft Research CambridgeAndrew Blake, Microsoft distinguished scientist and managing director of Microsoft Research Cambridge, welcomes staff and gives an overview of Microsoft Research’s global labs. The mission of those labs are to expand the state of the art in each of the areas in which research is performed, to transfer innovative technologies rapidly into Microsoft products, and to ensure that Microsoft products have a future. Roger Needham helped with the original setup of Microsoft Research Cambridge in 1997, with Andrew...
Video details
Date: 27 September 2011
Duration: 00:31:13
Publisher: Microsoft
1–25 of 66
Sort
Show 25 | 50 | 100
123Next 
> Our research