Our research
Content type
+
Downloads (434)
+
Events (385)
 
Groups (149)
+
News (2550)
 
People (821)
 
Projects (1052)
+
Publications (11812)
+
Videos (5060)
Labs
Research areas
Algorithms and theory47205 (238)
Communication and collaboration47188 (182)
Computational linguistics47189 (169)
Computational sciences47190 (180)
Computer systems and networking47191 (644)
Computer vision208594 (24)
Data mining and data management208595 (34)
Economics and computation47192 (89)
Education47193 (77)
Gaming47194 (65)
Graphics and multimedia47195 (190)
Hardware and devices47196 (186)
Health and well-being47197 (68)
Human-computer interaction47198 (753)
Machine learning and intelligence47200 (672)
Mobile computing208596 (21)
Quantum computing208597 (7)
Search, information retrieval, and knowledge management47199 (591)
Security and privacy47202 (251)
Social media208598 (13)
Social sciences47203 (228)
Software development, programming principles, tools, and languages47204 (523)
Speech recognition, synthesis, and dialog systems208599 (36)
Technology for emerging markets208600 (24)
1–25 of 644
Sort
Show 25 | 50 | 100
1234567Next 
Publication details
Date: 1 October 2014
Type: Inproceeding
Publisher: European Association for Theoretical Computer Science
Andrew Baumann, Marcus Peinado, and Galen Hunt

To appear.

Publication details
Date: 1 October 2014
Type: Inproceeding
Publisher: USENIX – Advanced Computing Systems Association
Chloe Brown, Christos Efstratiou, Ilias Leontiadis, Daniele Quercia, Cecilia Mascolo, James Scott, and Peter Key

The layouts of the buildings we live in shape our everyday lives. In office environments, building spaces affect employees’ communication, which is crucial for productivity and innovation. However, accurate measurement of how spatial layouts affect interactions is a major challenge and traditional techniques may not give an objective view.

We measure the impact of building spaces on social interactions using wearable sensing devices. We study a single organization that moved between two...

Publication details
Date: 13 September 2014
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
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 September 2014
Type: Technical report
Publisher: Choose...
Number: MSR-TR-2014-15
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
Publication details
Date: 20 August 2014
Type: Technical report
Publisher: Microsoft Research
Number: MSR-TR-2014-95
Joseph Bonneau and Stuart Schechter

Challenging the conventional wisdom that users cannot remember cryptographically-strong secrets, we test the hypothesis that users can learn randomly-assigned 56-bit codes (encoded as either 6 words or 12 characters) through spaced repetition. We asked remote research participants to perform a distractor task that required logging into a website 90 times, over up to two weeks, with a password of their choosing. After they entered their chosen password correctly we displayed a short code (4 letters or 2...

Publication details
Date: 20 August 2014
Type: Inproceeding
Publisher: USENIX
Publication details
Date: 1 August 2014
Type: Inproceeding
Publisher: ACM
Peng Sun, Ratul Mahajan, Jennifer Rexford, Lihua Yuan, Ming Zhang, and Ahsan Arefin
Publication details
Date: 1 August 2014
Type: Inproceeding
Publisher: Choose...
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
Srikanth Kandula, Ishai Menache, Roy Schwartz, and Spandana Raj Babbula

Datacenter WAN traffic consists of long-term high priority transfers that have to be carried as soon as they arrive alongside large transfers with pre-assigned deadlines on their completion (ranging from minutes to hours). The ability to offer guarantees to large transfers is crucial for business needs and impacts overall cost-of-business. State-of-the-art traffic engineering solutions only consider the current time epoch and hence cannot provide pre-facto promises for long-lived transfers. We present...

Publication details
Date: 1 August 2014
Type: Inproceeding
Publisher: ACM SIGCOMM
Ali Munir, Ghufran Baig, Syed Irteza, Ihsan Qazi, Alex Liu, and Fahad R. Dogar
Publication details
Date: 1 August 2014
Type: Inproceeding
Publisher: ACM
Ravi Bhoraskar, Seungyeop Han, Jinseong Jeon, Tanzirul Azim, Shuo Chen, Jaeyeon Jung, Suman Nath, Rui Wang, and David Wetherall

We present an app automation tool called Brahmastra for helping app stores and security researchers to test thirdparty components in mobile apps at runtime. The main challenge is that call sites that invoke third-party code may be deeply embedded in the app, beyond the reach of traditional GUI testing tools. Our approach uses static analysis to construct a page transition graph and discover execution paths to invoke third-party code. We then perform binary rewriting to “jump start” the third-party code...

Publication details
Date: 1 August 2014
Type: Inproceeding
Publisher: USENIX – Advanced Computing Systems Association
Rohan Gandhi, Hongqiang Harry Liu, Y. Charlie Hu, Guohan Lu, Jitendra Padhye, Lihua Yuan, and Ming Zhang

Load balancing is a foundational function of datacenter infrastructures and is critical to the performance of online services hosted in datacenters. As the demand for cloud services grows, expensive and hard-to-scale dedicated hardware load balancers are being replaced with software load balancers that scale using a distributed data plane that runs on commodity servers. Software load balancers offer low cost, high availability and high flexibility, but suffer high latency and low capacity per load...

Publication details
Date: 1 August 2014
Type: Proceedings
Publisher: ACM – Association for Computing Machinery
Xin Jin, Hongqiang Harry Liu, Rohan Gandhi, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Jennifer Rexford, and Roger Wattenhofer

We present Dionysus, a system for fast, consistent network updates in software-defined networks. Dionysus encodes as a graph the consistency-related dependencies among updates at individual switches, and it then dynamically schedules these updates based on runtime differences in the update speeds of different switches. This dynamic scheduling is the key to its speed; prior update methods are slow because they pre-determine a schedule, which does not adapt to runtime conditions. Testbed experiments and...

Publication details
Date: 1 August 2014
Type: Proceedings
Publisher: ACM – Association for Computing Machinery
Hongqiang Harry Liu, Srikanth Kandula, Ratul Mahajan, Ming Zhang, and David Gelernter

Network faults such as link failures and high switch configuration delays can cause heavy congestion and packet loss. Because it takes time for the traffic engineering systems to detect and react to such faults, these conditions can last long—even tens of seconds. We propose forward fault correction (FFC), a proactive approach for handling faults. FFC spreads network traffic such that freedom from congestion is guaranteed under arbitrary combinations of up to k faults. We show how FFC can be practically...

Publication details
Date: 1 August 2014
Type: Proceedings
Publisher: ACM – Association for Computing Machinery
Dan Alistarh, Rati Gelashvili, and Adrian Vladu

We give message-optimal randomized algorithms for two fundamental
distributed assignment tasks, leader election and renaming.
In leader election, all n participants compete for a single item, whereas in renaming the n participants
each compete for one of n distinct items, or names.
The setting is the classic asynchronous message-passing model, where the n
processors communicate over unreliable channels, while timing and t < n / 2 processor crashes are controlled
by a...

Publication details
Date: 1 August 2014
Type: Technical report
Publisher: Choose...
Number: MSR-TR-2014-18
Publication details
Date: 1 August 2014
Type: Inproceeding
Publisher: Choose...
Xin Jin, Hongqiang Harry Liu, Rohan Gandhi, Srikanth Kandula, Ratul Mahajan, Ming Zhang, Jennifer Rexford, and Roger Wattenhofer
Publication details
Date: 1 August 2014
Type: Inproceeding
Publisher: Choose...
Karthick Jayaraman, Nikolaj Bjrner, Geoff Outhred, and Charlie Kaufman

Network connectivity policies are crucial for assuring the security and availability of large-scale datacenter. Managing these policies is fraught with complexity and operator errors. The difficulties are exacerbated when deploying large scale offerings of public cloud services where multiple tenants are hosted within customized isolation boundaries. In these large-scale settings it is impractical to depend on human effort or trial and error to maintain the correctness and consistency of...

Publication details
Date: 26 July 2014
Type: Technical report
Publisher: Microsoft Research
Number: MSR-TR-2014-102
Ying Yan, Liang Jeff Chen, and Zheng Zhang

Aggregation queries are at the core of business intelligence and data analytics. In the big data era, many scalable shared-nothing systems have been developed to process aggregation queries over massive amount of data. Microsoft's SCOPE is a well-known instance in this category. Nevertheless, aggregation queries are still expensive, because query processing needs to consume the entire data set, which is often hundreds of terabytes. Data sampling is a technique that samples a small portion of data to...

Publication details
Date: 1 July 2014
Type: Inproceeding
Publisher: VLDB – Very Large Data Bases
Milovan Duric, Oscar Palomar, Aaron Smith, Milan Stanic, Osman Unsal, Adrian Cristal, Mateo Valero, Doug Burger, and Alex Veidenbaum
Publication details
Date: 1 July 2014
Type: Inproceeding
Shaolei Ren, Yuxiong He, and Kathryn McKinley

To improve performance and meet power constraints, vendors are introducing heterogeneous multicores that combine high performance and low power cores. However, choosing which cores and scheduling applications on them remain open problems. This paper presents a scheduling algorithm that provably minimizes energy on heterogeneous multicores and meets latency constraints for interactive applications, such as search, recommendations, advertisements, and games. Because interactive applications must...

Publication details
Date: 1 July 2014
Type: Technical report
Publisher: Choose...
Number: MSR-TR-2014-101
Myeongjae Jeon, Saehoon Kim, Seung-won Hwang, Yuxiong He, Sameh Elnikety, Alan L. Cox, and Scott Rixner

Web search engines are optimized to reduce the high-percentile response time to consistently provide fast responses to almost all user queries. This is a challenging task because the query workload exhibits large variability, consisting of many short-running queries and a few long-running queries that significantly impact the high-percentile response time. With modern multicore servers, parallelizing the processing of an individual query is a promising solution to reduce query execution time, but it...

Publication details
Date: 1 July 2014
Type: Inproceeding
Publisher: ACM
Jongsoo Jeong, Jongjun Park, Hoon Jeong, JongArm Jun, Chieh-Jan Mike Liang, and JeongGil Ko

Tightly synchronizing transmissions of the same packet from different sources theoretically results in constructive interference. Exploiting this property potentially speeds up network-wide packet propagation with minimal latencies. Our empirical results suggest the timing constraints can be relaxed in the real world, especially for radios using lower frequencies such as the IEEE 802.15.4 radios at 900 MHz. Based on these observations we propose PEASST, a topology-free protocol that leverages...

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