Our research
Content type
+
Downloads (424)
+
Events (356)
 
Groups (147)
+
News (2469)
 
People (826)
 
Projects (1019)
+
Publications (11441)
+
Videos (4866)
Labs
Research areas
Algorithms and theory47205 (80)
Communication and collaboration47188 (99)
Computational linguistics47189 (42)
Computational sciences47190 (78)
Computer systems and networking47191 (269)
Computer vision208594 (12)
Data mining and data management208595 (3)
Economics and computation47192 (19)
Education47193 (31)
Gaming47194 (42)
Graphics and multimedia47195 (126)
Hardware and devices47196 (87)
Health and well-being47197 (25)
Human-computer interaction47198 (262)
Machine learning and intelligence47200 (155)
Mobile computing208596 (1)
Quantum computing208597 (0)
Search, information retrieval, and knowledge management47199 (192)
Security and privacy47202 (81)
Social media208598 (2)
Social sciences47203 (95)
Software development, programming principles, tools, and languages47204 (186)
Speech recognition, synthesis, and dialog systems208599 (2)
Technology for emerging markets208600 (0)
1–25 of 80
Sort
Show 25 | 50 | 100
1234Next 
Site under construction
Project details
We work on questions motivated by machine learning, in particular from the theoretical and computational perspectives. Our goals are to mathematically understand the effectiveness of existing learning algorithms and to design new learning algorithms. We combine expertise from diverse fields such as algorithms and complexity, statistics, and convex geometry.
Project details
MSR has a strong group of scientists working on algorithm design, analysis, and experimental evaluation, as well as researchers in related areas (e.g., coding theory), but no formal algorithms group. The Virtual Algorithms Center (VIRAL) brings these individuals together. The goals of the center is to enhance collaboration between algorithms researchers and the rest of MSR, provide internal consulting, and give an external view of the algorithms research at MSR.
Project details
Tabular is a Excel add-in that brings the power of model based machine learning to data enthusiasts. It allows the user to write a simple model that explains their data and perform Bayesian inference. Tabular is built on top of Infer.NET.
Project details
Labs: Cambridge
Crowded: Digital Piecework and the Politics of Platform Responsibility in Precarious Times looks as crowdsourcing as a focal point for many of the issues that are raised by the structure of our current information economy: economic value, cultural meaning, and ethics.
Project details
Project details
Labs: New York | Redmond
Project details
Labs: Redmond
Project details
Labs: Redmond
It has become increasingly difficult to process information from the vast amount of data collected and stored in different computer systems all around us. The main challenge is how to design distributed and scalable algorithms and systems to extract useful information from this large quantity of data. The goal of this project is to address various questions related to distributed and scalable processing of big data.
Project details
Labs: Cambridge
The performance of the elliptic curve method (ECM) for integer factorizationplays an important role in the security assessment of RSA-based protocols as a cofactorization tool inside the number field sieve. This webpage gives addition-subtracting chains to optimize Edwards ECM in terms of both performance and memory requirements. See for more details the "ECM at Work" paper.
Project details
Rainbow Tangle is a game on a sequence of permutations. The purpose of the game is to create as straight routes of the permutation particles as possible.
Project details
Labs: Redmond
We work on novel sampling techniques to design faster algorithms for solving problems on large data. Algorithmic applications of our methods include dimensionality reduction, clustering, and linear algebraic problems on large matrices.
Project details
Labs: India
In the last 25 years, Elliptic Curve Cryptography (ECC) has become a mainstream primitive for cryptographic protocols and applications. ECC has been standardized for use in key exchange and digital signatures. This project focuses on efficient generation of parameters and implementation of ECC and pairing-based crypto primitives, across architectures and platforms.
Project details
LIQUi|> (pronounced "liquid") is a software architecture and toolsuite for quantum computing. It is currently being developed and will include programming languages, optimization and scheduling algorithms, and quantum simulators. Ultimately, LIQUi|> will be used to translate a quantum algorithm written in the form of a high-level program into the low-level machine instructions for a quantum device.
Project details
Labs: Redmond
We introduced a game-theoretic framework for crowdsourcing systems.
Project details
Labs: Cambridge
Counterdog is an automated theorem prover for a counterfactual meta-logic on propositional Datalog. The prover is complete for the logic, and can prove (or disprove) counterfactual statements such as: "if 'p' is false in a Datalog program, but would be true if it contained 'a:-b', then 'b' is true in the program.". Counterdog is useful for reasoning about Datalog-based trust management languages. The theory and implementation were developed by Moritz Y. Becker and Nik Sultana.
Project details
Labs: Cambridge
In recent years, computational challenges have become more and more important to infer biologically relevant information from the vast amount of experimental data available to systems biologists. Building on work originally done by Marc Mezard and Riccardo Zecchina in the context of random instances of satisfiability, we are developing various computationally efficient algorithms for problems in systems biology.
Project details
Project details
What is the link between how problems are logically described in a formal language, and how they are solved by algorithms?
Project details
Labs: Cambridge
Time Series Foundation (TSF) is a .NET toolset for exploring new algorithms in time series analysis and forecasting. TSF is based on state space model methodology that includes all types of exponential smoothing, some autoregressive algorithms, and innovative algorithms for event detection and calendar event impact prediction. TSF implements an Excel interop layer and offers an Excel add-in that exposes a large subset of TSF functionality through the Excel ribbon UI.
Project details
Labs: Redmond
Automata is a .NET tool kit that provides facilities for manipulating and analyzing regular expressions, symbolic finite automata, and symbolic finite transducers. It supports automata and transducers where input and output alphabets can be fully symbolic. Constraints over the alphabets can be analyzed using Satisfiability Modulo Theory (SMT) solvers. The tool kit provides a particular extension that uses the Microsoft SMT solver Z3.
Project details
Labs: Redmond
It is often the case that mutually distrustful parties need to perform a joint computation but cannot afford to reveal their inputs to each other. This can occur, for example, during auctions, data mining, voting, negotiations and business analytics. Secure multi-party computation (MPC) allows a set of parties, each with a private input, to securely and jointly perform any computation over their inputs.
Project details
Scalable Joins is a new implementation of the Joins concurrency library designed to scale on parallel hardware.
Project details
Labs: Cambridge
Even with protections like array-bounds checking in place, C programs remain vulnerable to errors in untrusted third-party libraries. Yarra is a new extension to C that uses a combination of static and dynamic techniques to protect the integrity of critical data structures in a C program from corruption by buggy libraries. We have used Yarra to harden applications ranging from SSH, FTP, and HTTP servers to memory allocators like BGET from non-control data attacks in third party code.
Project details
Labs: Redmond
1–25 of 80
Sort
Show 25 | 50 | 100
1234Next 
> Our research