Our research
Content type
+
Downloads (441)
+
Events (396)
 
Groups (150)
+
News (2593)
 
People (803)
 
Projects (1066)
+
Publications (12000)
+
Videos (5237)
Labs
Research areas
Algorithms and theory47205 (268)
Communication and collaboration47188 (187)
Computational linguistics47189 (186)
Computational sciences47190 (197)
Computer systems and networking47191 (678)
Computer vision208594 (47)
Data mining and data management208595 (62)
Economics and computation47192 (95)
Education47193 (79)
Gaming47194 (69)
Graphics and multimedia47195 (199)
Hardware and devices47196 (196)
Health and well-being47197 (77)
Human-computer interaction47198 (779)
Machine learning and intelligence47200 (721)
Mobile computing208596 (33)
Quantum computing208597 (19)
Search, information retrieval, and knowledge management47199 (617)
Security and privacy47202 (266)
Social media208598 (21)
Social sciences47203 (240)
Software development, programming principles, tools, and languages47204 (555)
Speech recognition, synthesis, and dialog systems208599 (72)
Technology for emerging markets208600 (25)
1–25 of 268
Sort
Show 25 | 50 | 100
1234567Next 
Shipra Agrawal and Nikhil R. Devanur

We introduce the online stochastic Convex Programming (CP) problem, a very general version of stochastic online problems which allows arbitrary concave objectives and convex feasibility constraints. Many well-studied problems like online stochastic packing and covering, online stochastic matching with concave returns, etc. form a special case of online stochastic CP. We present fast algorithms for these problems, which achieve near-optimal regret guarantees for both the i.i.d. and the...

Publication details
Date: 1 January 2015
Type: Inproceeding
Publisher: SIAM – Society for Industrial and Applied Mathematics
Purushottam Kar, Harikrishna Narasimhan, and Prateek Jain

Modern applications in sensitive domains such as biometrics and medicine frequently require the use of non-decomposable loss functions such as precision@k, F-measure etc. Compared to point loss functions such as hinge-loss, these offer much more fine grained control over prediction, but at the same time present novel challenges in terms of algorithm design and analysis. In this work we initiate a study of online learning techniques for such non-decomposable loss functions with an aim to enable...

Publication details
Date: 1 December 2014
Type: Inproceeding
Publisher: Neural Information Processing Systems
Prateek Jain, Ambuj Tewari, and Purushottam Kar

The use of M-estimators in generalized linear regression models in high dimensional settings requires risk minimization with hard L0 constraints. Of the known methods, the class of projected gradient descent (also known as iterative hard thresholding (IHT)) methods is known to offer the fastest and most scalable solutions. However, the current state-of-the-art is only able to analyze these methods in very restrictive settings which do not hold in high dimensional statistical models. In this...

Publication details
Date: 1 December 2014
Type: Inproceeding
Publisher: Neural Information Processing Systems
James Cook, Abhimanyu Das, Krishnaram Kenthapadi, and Nina Mishra

A discussion group is a repeated, synchronized conversation organized around a specific topic. Groups are extremely valuable to the attendees, creating a sense of community among like-minded users. While groups may involve many users, there are many outside the group that would benefit from participation. However, finding the right group is not easy given their quantity and given topic overlap. We study the following problem: given a search query, find a good ranking of discussion groups. We...

Publication details
Date: 1 October 2014
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Abhimanyu Das, Sreenivas Gollapudi, Arindam Khan, and Renato Paes Leme

Social networks serve as important platforms for users to express, exchange and form opinions on various topics. Several opinion dynamics models have been proposed to characterize how a user iteratively updates her expressed opinion based on her innate opinion and the opinion of her neighbors. The extent to how much a user is influenced by her neighboring opinions, as opposed to her own innate opinion, is governed by a measure of her “conformity’ parameter. Characterizing this degree of conformity for...

Publication details
Date: 1 October 2014
Type: Inproceeding
Publisher: Proc. Intl. Conference on Social Networks (COSN)
Edith Cohen, Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Danny Raz, and Yoav Tzur

Most discovery systems for silent failures work in two phases: a continuous monitoring phase that detects presence of failures through probe packets and a localization phase that pinpoints the faultyelement(s). We focus on the monitoring phase, where the goal is to balance the probing overhead with the cost associated with longer failure detection times.

We formulate a general model for the underlying fundamental subset-test scheduling problem. We unify the treatment of schedulers and cost...

Publication details
Date: 1 October 2014
Type: Technical report
Publisher: Elsevier
Number: MSR-TR-2014-113
Publication details
Date: 1 October 2014
Type: Inproceeding
Publisher: European Association for Theoretical Computer Science
Dan Alistarh, James Aspnes, Valerie King, and Jared Saia

We consider the problem of consensus in the challenging classic model. In this model, the adversary is adaptive; it can choose which processors crash at any point during the course of the algorithm. Further, communication is via asynchronous message passing: there is no known upper bound on the time to send a message from one processor to another, and all messages and coin flips are seen by the adversary.

We describe a new randomized consensus protocol for this model with expected message...

Publication details
Date: 1 October 2014
Type: Technical report
Number: MSR-TR-2014-15
Kshipra Bhawalkar, Sreenivas Gollapudi, and Debmalya Panigrahi

We consider a generic online allocation problem that generalizes the classical online set cover framework by considering requests comprising a set of elements rather than a single element. This problem has multiple applications in cloud computing, crowd sourcing, facility planning, etc. Formally, it is an online covering problem where each online step comprises an offline covering problem. In addition, the covering sets are capacitated, leading to packing constraints. We give a randomized algorithm for...

Publication details
Date: 4 September 2014
Type: Inproceeding
Publisher: Leibniz International Proceedings in Informatics
Nicolo Fusi, Christoph Lippert, Neil D Lawrence, and Oliver Stegle
Publication details
Date: 1 September 2014
Type: Article
Publisher: Nature Publishing Group
Dan Alistarh, Justin Kopinsky, Jerry Li, and Nir Shavit

High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a...

Publication details
Date: 1 September 2014
Type: Technical report
Number: MSR-TR-2014-16
Renchu Song, weiwei Sun, Baihua Zheng, and Yu Zheng

Location data becomes more and more important. In this paper, we focus on the trajectory data, and propose a new framework, namely PRESS (Paralleled Road-Network-Based Trajectory Compression), to effectively compress trajectory data under road network constraints. Different from existing work, PRESS proposes a novel representation for trajectories to separate the spatial representation of a trajectory from the temporal representation, and proposes a Hybrid Spatial Compression (HSC) algorithm and error...

Publication details
Date: 1 September 2014
Type: Inproceeding
Markus N. Rabe, Christoph M. Wintersteiger, Hillel Kugler, Boyan Yordanov, and Youssef Hamadi

We present a novel technique to analyze the bounded reachability probability problem for large Markov chains. The essential idea is to incrementally search for sets of paths that lead to the goal region and to choose the sets in a way that allows us to easily determine the probability mass they represent. To effectively analyze the system dynamics using an SMT solver, we employ a finite-precision abstraction on the Markov chain and a custom quantifier elimination strategy. Through experimental...

Publication details
Date: 1 September 2014
Type: Inproceeding
Publisher: Springer
Yuchen Zhang and Lin Xiao

We consider a generic convex optimization problem associated with regularized empirical risk minimization of linear predictors. The problem structure allows us to reformulate it as a convex-concave saddle point problem. We propose a stochastic primal-dual coordinate (SPDC) method, which alternates between maximizing over a randomly chosen dual variable and minimizing over the primal variable. An extrapolation step on the primal variable is performed to obtain accelerated convergence rate. We also...

Publication details
Date: 1 September 2014
Type: Technical report
Number: MSR-TR-2014-123
Yoram Bachrach, Vasilis Syrgkanis, Eva Tardos, and Milan Vojnovic

We introduce a framework for studying the effect of cooperation on the quality of outcomes in utility games. Our framework is a coalitional analog of the smoothness framework of non-cooperative games. Coalitional smoothness implies bounds on the strong price of anarchy, the loss of quality of coalitionally stable outcomes. Our coalitional smoothness framework captures existing results bounding the strong price of anarchy of network design games. Moreover, we give novel strong price of anarchy results...

Publication details
Date: 1 September 2014
Type: Inproceeding
Publisher: Springer
Christoph Lippert, Jing Xiang, Danilo Horta, Christian Widmer, Carl Kadie, David Heckerman, and Jennifer Listgarten
Publication details
Date: 1 September 2014
Type: Article
Publisher: Oxford University Press
Edith Cohen, Daniel Delling, Thomas Pajor, and Renato F. Werneck

Closeness centrality, first considered by Bavelas (1948), is an importance measure of a node in a network which is based on the distances from the node to all other nodes. The classic definition, proposed by Bavelas (1950), Beauchamp (1965), and Sabidussi (1966), is (the inverse of) the average distance to all other nodes.

We propose the first highly scalable (near linear-time processing and linear space overhead) algorithm for estimating, within a small relative error, the classic closeness...

Publication details
Date: 29 August 2014
Type: Technical report
Number: MSR-TR-2014-71
Joppe W. Bos, Craig Costello, Michael Naehrig, and Douglas Stebila

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 with traditional authentication using...

Publication details
Date: 5 August 2014
Type: Technical report
Number: MSR-TR-2014-107
Edith Cohen, Daniel Delling, Thomas Pajor, and Renato Werneck

Propagation of contagion through networks is a fundamental process. It is used to model the spread of information, influence, or a viral infection. Diffusion patterns can be specified by a probabilistic model, such as Independent Cascade (IC), or captured by a set of representative traces.

Basic computational problems in the study of diffusion are influence queries (determining the potency of a specified seed set of nodes) and Influence Maximization (identifying the...

Publication details
Date: 1 August 2014
Type: Technical report
Publisher: Microsoft Research
Number: MSR-TR-2014-110
Fisher J., Piterman N., and Rastislav Bodik
Publication details
Date: 1 August 2014
Type: Article
Publisher: .
Wilkinson A., Kawata V.K.S., Schütte J., Gao X., Antoniou S., Baumann C., Woodhouse S., Hannah R., Tanaka Y., Swiers G., Moignard V., Fisher J., Hidetoshi S., Tijssen M.R., de Bruijn M.F.T.R., Liu P., and Göttgens B.
Publication details
Date: 1 August 2014
Type: Article
Publisher: The Company of Biologists
Florian Bourse, Marc Lelarge, and Milan Vojnovic

Balanced edge partition has emerged as a new approach to partition an input graph data for the purpose of scaling out parallel computations, which is of interest for several modern data analytics computation platforms, including platforms for iterative computations, machine learning problems, and graph databases. This new approach stands in a stark contrast to the traditional approach of balanced vertex partition, where for given number of partitions, the problem is to minimize the number of edges cut...

Publication details
Date: 1 August 2014
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Konstantin Korovin and Margus Veanes

Combining classical automated theorem proving techniques with theory based reasoning, such as satisfiability modulo theories, is a new approach to first-order reasoning modulo theories. Skolemization is a classical technique used to transform first-order formulas into equisatisfiable form. We show how Skolemization can benefit from a new satisfiability modulo theories based simplification technique of formulas called monadic decomposition. The technique can be used to transform a theory dependent...

Publication details
Date: 1 August 2014
Type: Inproceeding
Publisher: Springer
Edith Cohen

Distance queries are a basic tool in data analysis. They are used for detection and localization of change for the purpose of anomaly detection, monitoring, or planning. Distance queries are particularly useful when data sets such as measurements, snapshots of a system, content, traffic matrices, and activity logs are collected repeatedly.

Random sampling, which can be efficiently performed over streamed or distributed data, is an important tool for scalable data analysis. The sample...

Publication details
Date: 1 August 2014
Type: Technical report
Publisher: ACM – Association for Computing Machinery
Number: MSR-TR-2014-111
parik, cheng huang, sergey yekhanin, and bob jenkins

Consider a systematic linear code where some (local) parity symbols depend on few prescribed symbols, while other (heavy) parity symbols may depend on all data symbols. Such codes have been studied recently in the context of erasure coding for data storage, where the local parities facilitate fast recovery of any single symbol when it is erased, while the heavy parities provide tolerance to a large number of simultaneous erasures.

A code as above is maximally recoverable, if it corrects all...

Publication details
Date: 1 August 2014
Type: Article
Publisher: IEEE – Institute of Electrical and Electronics Engineers
1–25 of 268
Sort
Show 25 | 50 | 100
1234567Next 
> Our research