Our research
Content type
+
Downloads (443)
+
Events (398)
 
Groups (150)
+
News (2593)
 
People (803)
 
Projects (1065)
+
Publications (12017)
+
Videos (5260)
Labs
Research areas
Algorithms and theory47205 (58)
Communication and collaboration47188 (57)
Computational linguistics47189 (8)
Computational sciences47190 (69)
Computer systems and networking47191 (111)
Computer vision208594 (17)
Data mining and data management208595 (7)
Economics and computation47192 (25)
Education47193 (81)
Gaming47194 (21)
Graphics and multimedia47195 (62)
Hardware and devices47196 (62)
Health and well-being47197 (28)
Human-computer interaction47198 (146)
Machine learning and intelligence47200 (80)
Mobile computing208596 (9)
Quantum computing208597 (16)
Search, information retrieval, and knowledge management47199 (61)
Security and privacy47202 (24)
Social media208598 (5)
Social sciences47203 (37)
Software development, programming principles, tools, and languages47204 (31)
Speech recognition, synthesis, and dialog systems208599 (5)
Technology for emerging markets208600 (2)
1–25 of 5260
Sort
Show 25 | 50 | 100
1234567Next 
William Gibson
The PeripheralAs a favor to her brother Burton, Flynne Fisher fills in on a mysterious job beta testing a new game. She's glad for the work, as money is tight with her mother needing constant medical care and Burton having financial troubles since he left the marines. Remotely flying a copter around a high-rise building, Flynne is tasked with simply keeping the paparazzi drones away from one of the apartments, but after she witnesses a murder, everything in her life is going to change.
Video details
Date: 28 October 2014
Duration: 00:58:24
Collection: Visiting Speakers Series
Jim Dwyer
More Awesome Than Money: Four Boys and Their Heroic Quest to Save Your Privacy from FacebookDavid versus Goliath in Silicon Valley - an epic attempt to take back the Internet: Their idea was simple. Four NYU undergrads wanted to build a social network that would allow users to control their personal data, instead of surrendering it to big businesses like Facebook. They called it Diaspora. In days, they raised $200,000, and reporters, venture capitalists, and the digital community's most legendary figures were soon monitoring their progress. Max dreamed of being a CEO. Ilya was the idealist. Dan...
Video details
Date: 27 October 2014
Duration: 00:48:02
Collection: Visiting Speakers Series
Tim Wood
Isomorphism and Program EquivalenceTim will talk about two related pieces of work. Both use the idea of isomorphism as a means of understanding program modifications.Program Equivalence From Trace Equivalence: Joint work with Sophia DrossopoulouOften when programmers modify source code they intend to preserve some parts of the program behaviour. We propose a formal criterion by which to characterise the preserved part of the program behaviour. Two program versions are equivalent up to a set of affected objects A, if executions of the two...
Video details
Date: 27 October 2014
Duration: 01:00:03
Collection: MSR Talk Series
Tom Wies and Zvomir Pavlinovic
Automated Debugging as a Constraint Solving ProblemDebugging is one of the most time consuming aspects of software development. Any automation that reduces the manual effort involved in this task can have a significant impact on software productivity. An integral part of all debugging activities is error localization: once undesired behavior is spotted, the actual defect has to be identified before a fix can be developed. Most existing fault localization techniques rely on the availability of high quality test suites, which limits their applicability in...
Video details
Date: 27 October 2014
Duration: 01:05:32
Collection: MSR Talk Series
Ioana Dumitriu
Northwest Probability Seminar 2014 - A Regular Stochastic Block ModelThe famous Stochastic Block Model (SBM) has been recently completely solved independently by Massoulie and Mossel-Neeman-Sly. Inspired by their work, we have decided to examine a regular variant of the graph; the restrictive nature of the constraints makes the problem easier, but at the same time more challenging (given that we can push the thresholds lower, how much lower can we push them?) This is joint work with Gerandy Brito, Shirshendu Ganguly, Chris Hoffman, and Linh Tran.
Video details
Date: 25 October 2014
Duration: 00:43:21
Collection: Northwest Probability Seminar
Benjamin Young
Northwest Probability Seminar 2014 - Sampling from the Fomin-Kirillov distributionI will describe recent joint work with Sara Billey (UW) and Alexander Holroyd (MSR), generalizing earlier work of mine, in which we bijectively prove the general case of Macdonald's identity in Schubert calculus. As a consequence, we also get a sampling algorithm for a probability distribution on reduced words which is implicit in work of Fomin and Kirillov. The proof involves several novel uses of David Little's generalized 'bumping' algorithm.
Video details
Date: 25 October 2014
Duration: 00:40:00
Collection: Northwest Probability Seminar
Srinivasa Varadhan
Northwest Probability Seminar 2014 - The role of compactness in large deviations.The estimates obtained in large deviations are basically local estimates. While it is not a problem for lower bounds it is a problem for upper bounds. In the absence of exponential tightness some type of 'compactification' of the space is needed. We will look at some examples.
Video details
Date: 25 October 2014
Duration: 00:48:36
Collection: Northwest Probability Seminar
Tim Hulshof
Northwest Probability Seminar 2014 - Sharp higher order corrections for the critical value of a bootstrap percolation modelBootstrap Percolation (BP) models are simple cellular automata with a deterministic growth rule and random initial configuration. It is known that (critical) BP models on the lattice undergo a metastable phase transition on a lattice of fixed size, as the density of the initial configuration increases. Holroyd (2004) determined sharp first order asymptotics for the critical value for the canonical nearest-neighbor model in 2D. Surprisingly, this value turned out to be very far removed from computer...
Video details
Date: 25 October 2014
Duration: 00:37:06
Collection: Northwest Probability Seminar
Alexander Holroyd
Northwest Probability Seminar 2014 - Finitely dependent coloringDo local constraints demand global coordination? I'll address a particularly simple formulation of this question: can the vertices of a graph be assigned random colours in a stationary way, so that neighboring colours always differ, but without long-range dependence? The quest to answer this has led to the discovery of a beautiful yet mysterious new stochastic process that seemingly has no right to exist, while overturning the conventional thinking on a fundamental 49-year old question. (Joint work with...
Video details
Date: 25 October 2014
Duration: 00:41:21
Collection: Northwest Probability Seminar
Steven Johnson
How We Got to Now: Six Innovations That Made the Modern WorldWhat was the chain of unexpected connections that led from the search for clean water to the manufacture of computer chips? And how did the overheating of printing presses in the U.S. inspire mass migration and political transformation? How We Got to Now, explores the history of innovation over centuries, tracing facets of modern life (refrigeration, clocks, and eyeglass lenses, to name a few) from their creation by amateurs and entrepreneurs to their unintended historical consequences. This illustrated...
Video details
Date: 23 October 2014
Duration: 00:59:02
Collection: Visiting Speakers Series
Larry Zitnick
Computer Vision - StAR Lecture Series: Object RecognitionThe state-of-the-art in object recognition has undergone dramatic changes in the last 20 years. In this talk, I will review the progression of the field and discuss why various approaches both succeeded and failed. The talk will cover visual recognition from the early 90's, including handwritten digit and face detection, to the current state-of-the-art in deep learning applied to object categorization. Algorithms will be explained at an intuitive level. The talk is aimed at the non-expert in computer...
Video details
Date: 23 October 2014
Duration: 01:19:10
Collection: MSR Talk Series
Krysta Svore on quantum computing and machine learningSenior Researcher Krysta Svore comments on the potential effect quantum computing can have on machine learning.
Video details
Date: 23 October 2014
Duration: 00:01:38
Publisher: Microsoft
George Karachalias
Reasoning about GADT Pattern Matching in HaskellGeneralized Algebraic Data Types (GADTs) are a simple but powerful generalization of Algebraic Data Types (ADTs) in Haskell and the ML family.Reasoning about the accessibility of case branches and the exhaustiveness of pattern matching is a well studied and efficiently solved problem for ADTs. However, classic algorithms fall short in the presence of GADTs, issuing false warnings: Since GADT constructors introduce local constraints, we must allow for the fact that particular combinations of patterns and/or...
Video details
Date: 22 October 2014
Duration: 00:36:03
Collection: UK Cambridge - Lecture/Seminar
Harold Javid, Carlos Henrique de Brito Cruz, Jason Rhody, and Chris Mentzel
eScience 2014: Panel - The Strategic Importance of eScience
Video details
Date: 21 October 2014
Duration: 01:23:00
Collection: eScience
Video details
Date: 21 October 2014
Duration: 01:22:39
Collection: eScience
Rifat Shahriyar
Fast Conservative Garbage CollectionGarbage collectors are exact or conservative. An exact collector identifies all references precisely and may move referents and update references, whereas a conservative collector treats one or more of stack, register, and heap references as ambiguous. Ambiguous references constrain collectors in two ways. (1) Since they may be pointers, the collectors must retain referents. (2) Since they may be values, the collectors cannot modify them, pinning their referents.We explore conservative collectors for...
Video details
Date: 20 October 2014
Duration: 00:54:03
Collection: MSR Talk Series
Matthew Loper
An Approximate Differentiable RendererAlthough computer vision can be posed as an inverse rendering problem, most renderers are not tailored to this task. Our framework makes it simple to express a forward graphics model, automatically obtain derivatives with respect to the model parameters, and optimize over them. Built on a new autodifferentiation package and OpenGL, OpenDR provides color, depth and boundary renderers, and promotes the ability to construct functions of the renderers. We demonstrate the power and simplicity of programming...
Video details
Date: 20 October 2014
Duration: 01:00:09
Collection: UK Cambridge - Lecture/Seminar
AutoTag This is a demo video for the Windows 8.1 Universal application called AutoTag 'n Search My Photos.
Video details
Date: 17 October 2014
Duration: 00:03:42
Publisher: Microsoft
Roger Myerson
Sequential Equilibrium Distributions in Multi-Stage Games with Infinite Sets of Types and ActionsWe consider the question of how to define of sequential equilibria for multi-stage games with infinite type sets and infinite action sets. The definition should be a natural extension of Kreps and Wilson's 1982 definition for finite games, should yield intuitively appropriate solutions for various examples, and should exist for a broad class of economically interesting games.
Video details
Date: 17 October 2014
Duration: 01:05:42
Anup Rao and Navin Goyal
MSR Theory  Day - Part 34:15-4:35 Navin Goyal, MSR-India Title: Algorithms for independent component analysisAbstract: Independent component analysis is a problem in signal processing. In this problem, we are given linear superposition of independent signals. E.g., we could be receiving data from several sensors but the receiver only gets the sum of these signals. The problem is to recover the original signal from the superposed data. In some situations this turns out to be possible. In this talk I will discuss a provably...
Video details
Date: 15 October 2014
Duration: 00:53:54
Sebastien Bubeck and Nick Gravin
MSR Theory  Day - Part 23:10-3:30 Sebastien Bubeck, MSR-Redmond Title: On the influence of the seed in random recursive treesAbstract: Let S be a fixed (seed) tree, and T be a large tree grown according to the uniform attachment process initialized on S. We are interested in whether T still contains information about S, even as the size of T goes to infinity. Perhaps surprisingly, we show that different seeds always lead to different distributions for the limiting trees (from a total variation point of view). 3:35-3:55 Nick...
Video details
Date: 15 October 2014
Duration: 00:49:41
Video details
Date: 15 October 2014
Duration: 00:20:46
Video details
Date: 15 October 2014
Duration: 01:07:06
Video details
Date: 15 October 2014
Duration: 00:32:26
Video details
Date: 15 October 2014
Duration: 00:34:49
1–25 of 5260
Sort
Show 25 | 50 | 100
1234567Next 
> Our research