Discover an index of datasets, SDKs, APIs and open-source tools developed by Microsoft researchers and shared with the global academic community below. These experimental technologies—available through Azure AI Foundry Labs (opens in new tab)—offer a glimpse into the future of AI innovation.
This code is a companion to the paper “Sequential File Programming Patterns and Performance with .NET” by Peter Kukol and Jim Gray, MSR-TR-2004-136. It contains 4 projects. (1) IOexamples shows the simple design patterns for…
Comega is an experimental language which extends C# with new constructs for relational and semi-structured data access and asynchronous concurrency. Last published: October 28, 2004.
lcscbench is based on the front end of a compiler for C# written in C# and uses a generalized LR (GLR) parsing algorithm. Last published: July 20, 2004.
The Mesh Connectivity Layer (MCL) driver with Link-Quality Source Routing (LQSR). LQSR is a routing protocol for ad-hoc networks. MCL implements a virtual network adapter, so that to the rest of the system the ad-hoc…
This code is a nonstandard combination of an expository article, an algorithm animation, and a research tool. It describes the common idea behind algorithms solving three basic graph theory problems, planarity, connectivity, and maximum cut.…
This package implements the Broder et al method for approximating the Jaccard metric for comparing two text files. The Jaccard metric measures the similarity of two sets of features by computing the cardinality of the…
By acquiring two digital images of a scene, one with flash and one without flash, we let the user subsequently interpolate the images to obtain any continuous flash intensity, and even extrapolate beyond the original…
A fast, flexible, perl-compliant regular expression template library for C++. Last published: August 25, 2003.
When people translate documents from one language to another, not all sentences are translated one-for-one. This Perl code implements an algorithm for finding which sentences do translate one-for-one in a parallel bilingual corpus.
Prolog implementations of two versions of the unfication grammar sentence realization aglorithm described in “A Complete, Efficient Sentence Realization Algorithm for Unification Grammar,” appearing in the Proceedings of the International Natural Language Generation Conference, INLG’02,…
