Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Our research
Content type
+
Downloads (446)
+
Events (417)
 
Groups (143)
+
News (2639)
 
People (732)
 
Projects (1065)
+
Publications (12160)
+
Videos (5360)
Labs
Research areas
Algorithms and theory47205 (60)
Communication and collaboration47188 (63)
Computational linguistics47189 (10)
Computational sciences47190 (69)
Computer systems and networking47191 (118)
Computer vision208594 (19)
Data mining and data management208595 (7)
Economics and computation47192 (25)
Education47193 (82)
Gaming47194 (21)
Graphics and multimedia47195 (62)
Hardware and devices47196 (65)
Health and well-being47197 (28)
Human-computer interaction47198 (151)
Machine learning and intelligence47200 (83)
Mobile computing208596 (12)
Quantum computing208597 (16)
Search, information retrieval, and knowledge management47199 (61)
Security and privacy47202 (24)
Social media208598 (10)
Social sciences47203 (41)
Software development, programming principles, tools, and languages47204 (33)
Speech recognition, synthesis, and dialog systems208599 (9)
Technology for emerging markets208600 (4)
1–25 of 5360
Sort
Show 25 | 50 | 100
1234567Next 
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
Amit Sharma
The Interplay of Social Influence and Own Preference in Social NetworksSocial media features such as social explanations of recommendations (e.g., 'Amit liked this') and feeds of activity around items (e.g., listening to songs, visiting URLs, reading books) mean that we are often exposed to our friends' preferences online. This raises the question of how those preferences interact with our own, both at the individual level – how do people influence each other's choices – and globally – how do these preferences affect the diffusion of items through networks?In this talk, I...
Video details
Date: 21 January 2015
Duration: 01:01:04
Collection: Candidate Talk
Konstantin Kashin
Causal Inference without Control UnitsRandomized experiments are the gold standard for causal claims, yet randomization is not feasible or ethical for many questions in the social sciences. Researchers have thus devised methods that approximate experiments with observational data, usually via regression or matching. These techniques use nonexperimental control units to estimate counterfactuals. However, control units may be costly to obtain, incomparable to the treated units, or completely unavailable when all units are treated. We explore the...
Video details
Date: 20 January 2015
Duration: 01:05:31
Collection: Candidate Talk
Kai-Wei Chang
Practical Learning Algorithms for Structured PredictionMachine learning techniques have been widely applied in many areas. In many cases, high accuracy requires training on large amount of data, adding more expressive features and/or exploring complex input and output structures, often resulting in scalability problems. Nevertheless, we observed that by carefully selecting and caching samples, structures, or latent items, we can reduce the problem size and improve the training speed and eventually improve the performance. Based on this observation, we...
Video details
Date: 20 January 2015
Duration: 00:55:41
Collection: Candidate Talk
Shayan Oveis-Gharan
Effective-Resistance-Reducing Flows, Spectrally Thin Trees and Asymmetric TSPWe show that the integrality gap of the natural LP relaxation of the Asymmetric Traveling Salesman Problem is at most polyloglog(n). In other words, there is a polynomial time algorithm that approximates the value of the optimum tour within a factor of polyloglog(n). To prove this, we show that any k-edge-connected graph (for k=Omega(log(n))) has a polylog(k)/k thin tree. In this talk I will highlight the main ideas of our proof. This is a joint work with Nima Anari.
Video details
Date: 16 January 2015
Duration: 01:00:03
Collection: MSR Talk Series
Rebecca Yale Taft and Anant Bharadwaj
DataHub: A Hosted Platform for Organizing, Managing, Sharing, Collaborating, and Processing Data; E-Store: Fine-Grained Elastic Partitioning for Distributed Transaction Processing SystemsTitle: DataHub: A Hosted Platform for Organizing, Managing, Sharing, Collaborating, and Processing DataIn this talk, I will describe DataHub – a hosted data collaboration platform we are building at MIT. DataHub is a unified data management and collaboration platform. The DataHub platform is (a) a flexible data-store (files, relational databases, extendible to other data-storage backends) with sharing/collaboration, security, and other data management capabilities, managed on behalf of different...
Video details
Date: 15 January 2015
Duration: 01:29:08
Collection: MSR Talk Series
Alptekin Kupcu
Dynamic PDP vs. Dynamic POR: Are they really different ?As many services are moving to the cloud, we are losing control of our own data. This constitutes one of the biggest problems that we face in this decade. The talk will start simple, presenting basics of cryptographic mechanisms for security protection of outsourced data. The basics will include data structures, such as rank-based authenticated skip lists, used in dynamic provable data possession (DPDP) schemes. Later, we will switch gears, and talk about dynamic proofs of retrievability (DPOR) schemes....
Video details
Date: 14 January 2015
Duration: 00:52:51
Collection: UK Cambridge - Lecture/Seminar
Julian Bleecker
Next Future Laboratory
Video details
Date: 13 January 2015
Duration: 00:21:08
Collection: Social Computing Symposium
Video details
Date: 13 January 2015
Duration: 00:24:08
Collection: Social Computing Symposium
Video details
Date: 13 January 2015
Duration: 00:26:13
Collection: Social Computing Symposium
Video details
Date: 13 January 2015
Duration: 00:49:25
Collection: Social Computing Symposium
Video details
Date: 13 January 2015
Duration: 00:08:48
Collection: Social Computing Symposium
Video details
Date: 13 January 2015
Duration: 00:07:41
Collection: Social Computing Symposium
Video details
Date: 13 January 2015
Duration: 00:05:49
Collection: Social Computing Symposium
Dan Russell, Mizuko Ito, Amanda Williams, Anthony Coscia, Drew Harry, Gina Neff, Elan Lee, and Liz Gerber
Social Computing Symposium 2015: Audience Choice Talks I
Video details
Date: 12 January 2015
Duration: 00:57:04
Collection: Social Computing Symposium
Video details
Date: 12 January 2015
Duration: 00:15:44
Collection: Social Computing Symposium
Video details
Date: 12 January 2015
Duration: 00:14:46
Collection: Social Computing Symposium
Video details
Date: 12 January 2015
Duration: 00:05:57
Collection: Social Computing Symposium
Video details
Date: 12 January 2015
Duration: 00:24:55
Collection: Social Computing Symposium
Video details
Date: 12 January 2015
Duration: 00:19:48
Collection: Social Computing Symposium
Video details
Date: 12 January 2015
Duration: 00:08:51
Collection: Social Computing Symposium
Video details
Date: 12 January 2015
Duration: 00:19:08
Collection: Social Computing Symposium
Video details
Date: 12 January 2015
Duration: 00:22:26
Collection: Social Computing Symposium
Video details
Date: 12 January 2015
Duration: 00:15:56
Collection: Social Computing Symposium
1–25 of 5360
Sort
Show 25 | 50 | 100
1234567Next 
> Our research