Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Our research
Content type
+
Downloads (455)
+
Events (487)
 
Groups (150)
+
News (2849)
 
People (716)
 
Projects (1161)
+
Publications (13025)
+
Videos (6121)
Labs
Research areas
Algorithms and theory47205 (79)
Communication and collaboration47188 (63)
Computational linguistics47189 (11)
Computational sciences47190 (69)
Computer systems and networking47191 (129)
Computer vision208594 (23)
Data mining and data management208595 (12)
Economics and computation47192 (26)
Education47193 (84)
Gaming47194 (24)
Graphics and multimedia47195 (67)
Hardware and devices47196 (66)
Health and well-being47197 (32)
Human-computer interaction47198 (157)
Machine learning and intelligence47200 (97)
Mobile computing208596 (20)
Quantum computing208597 (26)
Search, information retrieval, and knowledge management47199 (62)
Security and privacy47202 (32)
Social media208598 (12)
Social sciences47203 (41)
Software development, programming principles, tools, and languages47204 (44)
Speech recognition, synthesis, and dialog systems208599 (10)
Technology for emerging markets208600 (6)
1–25 of 79
Sort
Show 25 | 50 | 100
1234Next 
Muthu Venkitasubramaniam
Charles River Crypto Day: On the Power of Secure Two-Party ComputationIshai, Kushilevitz, Ostrovsky and Sahai (STOC`07, SIAM JoC 2009) introduced the powerful “MPC-in-the-head” technique that provided a general transformation of information-theoretic MPC protocols secure against passive adversaries to a ZK proof in a “black-box” way. In this work, we extend this technique and provide a generic transformation of any semi-honest secure two-party computation (2PC) protocol (with mild adaptive security guarantees) in the so called oblivious-transfer hybrid model to an adaptive...
Video details
Date: 26 February 2016
Duration: 01:02:06
Collection: Crypto Colloquium
Silas Richelson
Charles River Crypto Day: Three-Round Non-Malleable Commitment from Non-Malleable CodesWe present a new non-malleable commitment protocol. Our protocol has the following features:The protocol has only three rounds of interaction. Pass (TCC 2013) showed an impossibility result for a two-round non-malleable commitment scheme w.r.t. a black-box reduction to any “standard” intractability reduction. Thus, this resolves the round complexity of non-malleable commitment at least w.r.t. black-box security reductions. Our construction is secure as per the standard notion of non-malleability w.r.t....
Video details
Date: 26 February 2016
Duration: 01:09:21
Collection: Crypto Colloquium
Omer Paneth
Charles River Crypto Day: Delegating RAM ComputationsIn the setting of cloud computing a user wishes to delegate its data, as well as computations over this data, to a cloud provider. Each computation may read and modify the data, and these modifications should persist between computations. Minding the computational resources of the cloud, delegated computations are modeled as RAM programs. In particular, the delegated computations’ running time may be sub-linear, or even exponentially smaller than the memory size.We construct a two-message protocol for...
Video details
Date: 26 February 2016
Duration: 01:04:00
Collection: Crypto Colloquium
Ron Rothblum
Charles River Crypto Day: Constant-Round Interactive-Proofs for Delegating ComputationsInteractive proofs have had a dramatic impact on Complexity Theory and Cryptography. In particular, the celebrated IP=PSPACE Theorem [LFKN92,Shamir92] allows an all-powerful but untrusted prover to convince a polynomial-time verifier of the validity of extremely complicated statements (as long as they can be evaluated using polynomial space). The interactive proof system designed for this purpose requires a polynomial number of communication rounds. It is very natural and well motivated to examine the...
Video details
Date: 26 February 2016
Duration: 01:10:00
Collection: Crypto Colloquium
Dave Wecker
LIQUi|> Simulator HistoryType a summary that describes the content of your video.
Video details
Date: 22 February 2016
Duration: 00:03:10
Publisher: Microsoft
Dave Wecker
LIQUi|> Simulation OptimizationType a summary that describes the content of your video.
Video details
Date: 22 February 2016
Duration: 00:03:37
Publisher: Microsoft
Dave Wecker and Krysta Svore
The Quantum ChallengeAll about the Quantum Challenge
Video details
Date: 22 February 2016
Duration: 00:01:31
Publisher: Microsoft
Dave Wecker and Krysta Svore
StationQ_OverviewType a summary that describes the content of your video.
Video details
Date: 22 February 2016
Duration: 00:03:07
Publisher: Microsoft
Dave Wecker
LIQUi|> Quantum ChemistryType a summary that describes the content of your video.
Video details
Date: 22 February 2016
Duration: 00:03:36
Publisher: Microsoft
Video details
Date: 15 February 2016
Duration: 00:02:27
Publisher: Microsoft
Deeparnab Chakrabarty
Deeparnab Chakrabarty: Provable Submodular Function Minimization via Fujishige Wolfe AlgorithmThe Fujishige-Wolfe heuristic is empirically one of the fastest algorithms for Submodular Function Minimization and is based upon Wolfe's algorithm to find the nearest point on a polytope to the origin. There was no theoretical guarantees known for the same. In this work we give a convergence analysis for Wolfe's algorithm which implies a pseudo-polynomial running time for the Fujishige Wolfe algorithm.
Video details
Date: 1 February 2016
Duration: 00:02:59
Publisher: Microsoft
Yin Tat Lee
Recent Developments in Combinatorial OptimizationIn the past several years, there has been a lot of progress on combinatorial optimization. Using techniques in convex optimization, geometry, spectral graph theory and randomization, researchers have developed provably faster algorithms for many classical problems such as linear programming and maximum flow problems. In this talk, I will discuss my work in this area and illustrate it through my recent result on the feasibility problem. Many optimization problems in computer science are shown to be...
Video details
Date: 15 January 2016
Duration: 00:39:53
Collection: Candidate Talk
Yash Deshpande
Computational Limits in Statistical Inference: Hidden Cliques and Sum of SquaresCharacterizing the computational complexity of statistical inference problems is an outstanding open problem. This is gaining increasing importance given the ubiquity of large scale data analysis and algorithms in application domains as diverse as genomics, healthcare, finance and social sciences. The hidden clique problem is a prototypical example of an inference problem wherein computational constraints dramatically alter the inference ability. The hidden clique problem posits to find a 'hidden' or...
Video details
Date: 4 January 2016
Duration: 01:03:09
Collection: Candidate Talk
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
1–25 of 79
Sort
Show 25 | 50 | 100
1234Next 
> Our research