Microsoft Research

It is a known fact that finitary state abstraction methods, such as predicate abstraction, are inadequate for verifying general liveness properties or even termination of sequential programs.

The queries that users pose to web search engines range from two to four terms in length. Much effort has been spent on handling these queries, with considerable success.

We describe a new fault localization technique for software bugs in large-scale computing systems.

Anonymous credential systems allow users to anonymously obtain credentials from organizations, and to anonymously and unlinkably prove possesion of valid credentials.

As researchers, one of our common goals is to expand our reach and our capabilities as human beings through the development of new technologies and new ideas.

In recent years, abundant DNA sequence data has led to widespread interest in computational methods for detecting sequences that are evolving faster, slower, or by different patterns of evolution

The talk will outline the history of the Handheld Augmented Reality (AR) project at Graz University of Technology to point out how mobile-phone AR evolved and which further developments are to be

In view of the recent hardness results for mixed Nash equilibria, there has been increased interest in computing approximate equilibrium points, albeit progress has been slow.

Embedded systems are often subject to real-time constraints. Such systems require determinism to ensure that task deadlines are met.

Six years ago in Scientific American, Tim Berners-Lee, James Hendler and Ora Lassila unveiled a nascent vision of the Semantic Web: a highly interconnected network of data that could be easily

Recent advances in graphics processing units (GPUs) have resulted in massively parallel hardware that is easily programmable and widely available in commodity desktop computer systems.

Our long term aim is to contribute to a future Helpful

Finding an common independent set in two matroids is one of the classical problems of combinatorial optimization, including the well-known bipartite matching problem as a special case.

Similarity search is the problem of preprocessing a database of N objects in such a way that given a query object, one can effectively determine its nearest neighbors in database.

This is a methodology colloquium talk.

We will survey recent work in the design of approximation algorithms for several discrete stochastic optimization problems, with a particular focus on 2-stage problems with recourse.

In networked haptic environments ΓÇö used in surgical simulation training, maintenance task training, force-feedback enabled network games, etc.ΓÇö multiple users remotely collaborate sharing the

I will consider the design of efficient and profit-maximizing Bayesian incentive-compatible mechanisms for general dynamic environments with private information.

This talk describes what Stanford is doing in Design; including a description of the graduate Joint Program in Design, the new Hasso Platner Institute of Design (the d.school), and the Design for

We give an overview of a new software side-channel attack, enabled by the branch prediction capability common to all modern high-performance CPUs.

Network games play a fundamental role in understanding behaviour in many domains, ranging from communication networks through markets to social networks.

We present a technique which improves the Kneser- Ney smoothing algorithm on small data sets for bigrams and we develop a numerical algorithm which computes the parameters for the heuristic formula

Start with n particles at each of k points in the integer lattice Z^d, and let each particle perform simple random walk until it reaches an unoccupied site.

The ability to exploit transient communication opportunities allows mobile systems to trade off higher performance and dramatically lower energy and monetary costs for an increase in algorithmic

This talk takes a long view on how we approach the problem of parsing natural language.

Traditional Coding Theory, inspired by Shannon's motivations in communication problems, has been very successful in proposing meaningful abstractions (e.g Hamming distance, code rate, decoding

View Behind

Bond percolation on a graph G with parameter p in [0,1] is the random subgraph G_p of G obtained by independently deleting each edge with probability 1-p and retaining it with probability p.

Diverse control and measurement applications, such as mobile phone testing, process optimization, and distributed sonic arrays all require precise timing and synchronization.

If you go to Amazon.com or the Apple Itunes store, your ability to search for new music will largely be limited by the `query-by-metadata' paradigm: search by song, artist or album name.