Our research
##### Content type
+
+
Events (444)

Groups (151)
+
News (2727)

People (738)

Projects (1102)
+
Publications (12539)
+
Videos (5665)
##### Research areas
Algorithms and theory47205 (335)
Communication and collaboration47188 (214)
Computational linguistics47189 (238)
Computational sciences47190 (220)
Computer systems and networking47191 (758)
Computer vision208594 (907)
Data mining and data management208595 (105)
Economics and computation47192 (104)
Education47193 (82)
Gaming47194 (76)
Graphics and multimedia47195 (233)
Hardware and devices47196 (215)
Health and well-being47197 (91)
Human-computer interaction47198 (887)
Machine learning and intelligence47200 (881)
Mobile computing208596 (54)
Quantum computing208597 (32)
Search, information retrieval, and knowledge management47199 (682)
Security and privacy47202 (309)
Social media208598 (44)
Social sciences47203 (261)
Software development, programming principles, tools, and languages47204 (620)
Speech recognition, synthesis, and dialog systems208599 (129)
Technology for emerging markets208600 (32)
1–25 of 335
Sort
Show 25 | 50 | 100
1234567Next

The advances in location-acquisition and mobile computing techniques have generated massive spatial trajectory data, which represent the mobility of a diversity of moving objects, such as people, vehicles and animals. Many techniques have been proposed for processing, managing and mining trajectory data in the past decade, fostering a broad range of applications. In this article, we conduct a systematic survey on the major research into trajectory data mining, providing a panorama of the field...

##### Publication details
Date: 1 September 2015
Type: Article
Publisher: ACM – Association for Computing Machinery

In natural language understanding (NLU), a user utterance can be labeled differently depending on the domain or application (e.g., weather vs. calendar). Standard domain adaptation techniques are not directly applicable to take advantage of the existing annotations because they assume that the label set is invariant. We propose a solution based on label embeddings induced from canonical correlation analysis (CCA) that reduces the problem to a standard domain adaptation task and allows use of a number of...

##### Publication details
Date: 29 August 2015
Type: Proceedings
Publisher: ACL – Association for Computational Linguistics

In this paper, we introduce the task of selecting compact lexicon from large, noisy gazetteers.
This scenario arises often in practice, in particular spoken language understanding (SLU).
We propose a simple and effective solution based on matrix decomposition techniques:
canonical correlation analysis (CCA) and rank-revealing QR (RRQR) factorization. CCA is first used to derive low-dimensional gazetteer embeddings from domain-specific search logs. Then RRQR is used to find a subset of...

##### Publication details
Date: 27 August 2015
Type: Proceedings
Publisher: ACL – Association for Computational Linguistics

Population protocols are networks of finite-state agents, interacting randomly, and updating their state using simple rules. Despite their extreme simplicity, these systems have been shown to cooperatively perform complex computational tasks, such as simulating register machines to compute standard arithmetic functions. The election of a unique leader agent is a key requirement in such computational constructions. Yet, the fastest currently known population protocol for electing a leader only...

##### Publication details
Date: 1 July 2015
Type: Inproceeding
Publisher: Springer

In this work, we consider the following random process, motivated by the analysis of lock-free concurrent algorithms under high memory contention. In each round, a new scheduling step is allocated to one of $n$ threads, according to a distribution $\vect{p} = (p_1, p_2, \ldots, p_n)$, where thread $i$ is scheduled with probability $p_i$. When some thread first reaches a set threshold of executed steps, it registers a \emph{win}, completing its current operation, and resets its step count to $1$. At...

##### Publication details
Date: 1 July 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
##### Publication details
Date: 1 July 2015
Type: Proceedings
Publisher: Springer

Population protocols, roughly defined as systems consisting of large numbers of simple identical agents, interacting at random and updating their state following simple rules, are an important research topic at the intersection of distributed computing and biology. One of the fundamental tasks that a population protocol may solve is majority: each node starts in one of two states; the goal is for all nodes to reach a correct consensus on which of the two states was initially the majority....

##### Publication details
Date: 1 July 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

The problem of electing a leader from among n contenders is one of the fundamental questions in distributed computing. In its simplest formulation, the task is as follows: given n processors, all participants must eventually return a win or lose indication, such that a single contender may win. Despite a considerable amount of work on leader election, the following question is still open: can we elect a leader in an asynchronous fault-prone system faster than...

##### Publication details
Date: 1 July 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

Modern software applications and services operate nowadays on top of large clusters and datacenters. To reduce the underlying infrastructure cost and increase utilization, different services share the same physical resources (e.g., CPU, bandwidth, I/O, memory). Consequently, the cluster provider often has to decide in real-time how to allocate resources in overbooked systems, taking into account the different characteristics and requirements of users. In this paper, we consider an important problem...

##### Publication details
Date: 1 June 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

Shpilka and Wigderson [SW99] had posed the problem of proving exponential lower bounds for (nonhomogeneous) depth three arithmetic circuits with bounded bottom fanin over a field F of characteristic zero. We resolve this problem by proving a NOmega(d/t) lower bound for (nonhomogeneous) depth three arithmetic circuits with bottom fanin at most t computing an explicit N-variate polynomial of degree d over F.

##### Publication details
Date: 1 June 2015
Type: Inproceeding
Publisher: LIPICS
##### Publication details
Date: 1 June 2015
Type: Article

We study the problem of placing streaming queries into servers. Unlike previous work, we focus on queries that consume events of relative low rates, each computed in a single server (i.e. no scaling out per query). However, we need to place a very large and dynamic number of queries in relatively few servers. Our focus is motivated by the need to support a platform for hosting end-user streaming queries that may come from a variety of applications, such as the Cortana personal assistant.

The...

##### Publication details
Date: 1 June 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

Lattice-based cryptographic primitives are believed to offer resilience against attacks by quantum computers. We demonstrate the practicality of post-quantum key exchange by constructing ciphersuites for the Transport Layer Security (TLS) protocol that provide key exchange based on the ring learning with errors (R-LWE) problem; we accompany these ciphersuites with a rigorous proof of security. Our approach ties lattice-based key exchange together...

##### Publication details
Date: 18 May 2015
Type: Inproceeding
Publisher: IEEE – Institute of Electrical and Electronics Engineers

A web search engine often employs partition-aggregate architecture, where an aggregator propagates a user query to all index serving nodes (ISNs) and collects the responses from them. An aggregation policy determines how long the aggregators wait for the ISNs before returning aggregated results to users, crucially affecting both query latency and quality. Designing an aggregation policy is, however, challenging: Response latency among queries and among ISNs varies significantly, and aggregators lack of...

##### Publication details
Date: 1 May 2015
Type: Technical report
Number: MSR-TR-2015-39

In this work, we consider the following random process, motivated by the analysis of lock-free concurrent algorithms under stochastic schedulers. In each step, a new ball is allocated into one of $n$ bins, according to a distribution $\vect{p} = (p_1, p_2, \ldots, p_n)$, where each ball goes to bin $i$ with probability $p_i$. When some bin first reaches a set threshold of balls, it registers a \emph{win}, and resets its ball count to $1$. At the same time, bins whose ball count was close to the...

##### Publication details
Date: 1 May 2015
Type: Technical report
Number: MSR-TR-2015-41

We select a set of elliptic curves for cryptography and analyze our selection from a performance and security perspective. This analysis complements recent curve proposals that suggest (twisted) Edwards curves by also considering the Weierstrass model. Working with both Montgomery-friendly and pseudo-Mersenne primes allows us to consider more possibilities which help to improve the overall efficiency of base field arithmetic. Our Weierstrass...

##### Publication details
Date: 1 May 2015
Type: Article
Publisher: Springer

Computing outliers and related statistical aggregation functions from large-scale big data sources is a critical operation in many cloud computing scenarios, e.g. service quality assurance, fraud detection, or novelty discovery. Such problems commonly have to be solved in a distributed environment where each node only has a local slice of the entirety of the data. To process a query on the global data, each node must transmit its local slice of data or an aggregated subset thereof to a global aggregator...

##### Publication details
Date: 1 April 2015
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery

Liveness specifications on finite-state concurrent programs are checked using algorithms to detect reachable cycles in the state-transition graph of the program. We present new algorithms for cycle detection based on the idea of prioritized search via a delaying explorer. We present thorough evaluation of our algorithms on a variety of reactive asynchronous programs, including device drivers, distributed protocols, and other benchmarks culled from the research literature.

##### Publication details
Date: 25 March 2015
Type: Technical report
Number: MSR-TR-2015-28

We introduce symbolic tree automata as a generalization of finite tree automata with a parametric alphabet over any given background theory. We show that symbolic tree automata are closed under Boolean operations, and that the operations are effectively uniform in the given alphabet theory. This generalizes the corresponding classical properties known for finite tree automata.

##### Publication details
Date: 1 March 2015
Type: Article
Publisher: Elsevier
Number: 3

We introduce the concept of a delaying explorer with the
goal of performing prioritized exploration of the behaviors
of an asynchronous reactive program. A delaying explorer
stratifies the search space using a custom strategy, and a de-
lay operation that allows deviation from that strategy. We
show that prioritized search with a delaying explorer per-
forms significantly better than existing prioritization tech-
niques. We also demonstrate empirically the need for...

##### Publication details
Date: 1 March 2015
Type: Technical report
Number: MSR-TR-2015-25

We present several quantum algorithms for performing nearest-neighbor learning. At the core of our algorithms are fast and coherent quantum methods for computing distance metrics such as the inner product and Euclidean distance. We prove upper bounds on the number of queries to the input data required to compute these metrics. In the worst case, our quantum algorithms lead to polynomial reductions in query complexity relative to the corresponding classical algorithm. In certain cases, we show...

##### Publication details
Date: 1 March 2015
Type: Article
Publisher: Rinton Press
Number: 3&4

In a multi-k -ic depth three circuit every variable appears in at most k of the linear polynomials in every product gate of the circuit. This model is a natural generalization of multilinear depth three circuits that allows the formal degree of the circuit to exceed the number of underlying variables (as the formal degree of a multi-k-ic depth three circuit can be kn where n is the number of variables). The problem of proving lower bounds for depth three...

##### Publication details
Date: 1 March 2015
Type: Inproceeding
Publisher: LIPICS

Recently, it was shown that Repeat-Until-Success (RUS) circuits can achieve a 2.5 times reduction in expected T-count over ancilla-free techniques for single-qubit unitary decomposition. However, the previously best known algorithm to synthesize RUS circuits requires exponential classical runtime. In this paper we present an algorithm to synthesize an RUS circuit to approximate any given single-qubit unitary within precision ε in probabilistically polynomial classical runtime. Our synthesis approach...

##### Publication details
Date: 27 February 2015
Type: Article
Publisher: American Physical Society
Number: 080502

In many applications, the structure of data can be represented by a hyper-graph, where the data items are vertices, and the associations among items are represented by hyper-edges. Equivalently, we are given as input a bipartite graph with two kinds of vertices: items, and associations (which we refer to as topics). We consider the problem of partitioning the set of items into a given number of partitions, such that the maximum number of topics covered by a partition is minimized.

This is a...

##### Publication details
Date: 1 February 2015
Type: Technical report
Publisher: Microsoft Research
Number: MSR-TR-2015-15

Reconstruction of the molecular pathways controlling organ development has been hampered by a lack of methods to resolve embryonic progenitor cells. Here we describe a strategy to address this problem that combines gene expression profiling of large numbers of single cells with data analysis based on diffusion maps for dimensionality reduction and network synthesis from state transition graphs. Applying the approach to hematopoietic development in the mouse embryo, we map the progression of mesoderm...

##### Publication details
Date: 1 February 2015
Type: Article
Publisher: Nature Publishing Group
1–25 of 335
Sort
Show 25 | 50 | 100
1234567Next
> Our research