Our research
Content type
+
Downloads (421)
+
Events (354)
 
Groups (147)
+
News (2466)
 
People (825)
 
Projects (1021)
+
Publications (11427)
+
Videos (4857)
Labs
Research areas
Algorithms and theory47205 (208)
Communication and collaboration47188 (177)
Computational linguistics47189 (143)
Computational sciences47190 (159)
Computer systems and networking47191 (599)
Computer vision208594 (8)
Data mining and data management208595 (3)
Economics and computation47192 (81)
Education47193 (71)
Gaming47194 (63)
Graphics and multimedia47195 (178)
Hardware and devices47196 (173)
Health and well-being47197 (62)
Human-computer interaction47198 (715)
Machine learning and intelligence47200 (596)
Mobile computing208596 (7)
Quantum computing208597 (3)
Search, information retrieval, and knowledge management47199 (561)
Security and privacy47202 (218)
Social media208598 (5)
Social sciences47203 (219)
Software development, programming principles, tools, and languages47204 (495)
Speech recognition, synthesis, and dialog systems208599 (11)
Technology for emerging markets208600 (22)
1–25 of 11427
Sort
Show 25 | 50 | 100
1234567Next 
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
Zichao Qi, Yanghua Xiao, Bin Shao, and Haixun Wang
Publication details
Date: 1 September 2014
Type: Inproceeding
Publisher: Very Large Data Bases Endowment Inc.
Badrish Chandramouli, Jonathan Goldstein, and Abdul Quamar
Analytics over the increasing quantity of data stored in the Cloud has become very expensive, particularly due to the pay-as-you-go Cloud computation model. Data scientists typically manually extract samples of increasing data size (progressive samples) using domain-specific sampling strategies for exploratory querying. This provides them with user-control, repeatable semantics, and result provenance. However, such solutions result in tedious workflows that preclude the reuse of work across samples. On the...
Publication details
Date: 1 August 2014
Type: Inproceeding
Badrish Chandramouli, Suman Nath, and Wenchao Zhou
In feed-following applications such as Twitter and Facebook, users (consumers) follow a large number of other users (producers) to get personalized feeds, generated by blending producers' feeds. With the proliferation of Cloud-connected smart edge devices such as smartphones, producers and consumers of many feed-following applications reside on edge devices and the Cloud. An important design goal of such applications is to minimize communication (and energy) overhead of edge devices. In this paper, we...
Publication details
Date: 1 August 2014
Type: Inproceeding
M. Rötteler and R. Steinwandt
Improving over an earlier construction by Kaye and Zalka, Maslov et al. describe an implementation of Shor's algorithm which can solve the discrete logarithm problem on binary elliptic curves in quadratic depth O(n^2). In this paper we show that discrete logarithms on such curves can be found with a quantum circuit of depth O(log^2 n). As technical tools we introduce quantum circuits for GF(2^n) multiplication in depth O(log n) and for GF(2^n) inversion in depth O(log^2 n).
Publication details
Date: 1 July 2014
Type: Article
Publisher: Rinton Press
Aditya V. Nori, Chung-Kil Hur, Sriram K. Rajamani, and Selva Samuel
We present a new Markov Chain Monte Carlo (MCMC) sampling algorithm for probabilistic programs. Our approach and tool, called R2, has the unique feature of employing program analysis in order to improve the efficiency of MCMC sampling. Given an input program P, R2 propagates observations in P backwards to obtain a semantically equivalent program P0 in which every probabilistic assignment is immediately followed by an observe statement. Inference is performed by a suitably modified version of the...
Publication details
Date: 1 July 2014
Type: Inproceeding
Publisher: AAAI
Hongning Wang, Yang Song, Ming-Wei Chang, Xiaodong He, Ahmed Hassan, and Ryen White
Publication details
Date: 1 July 2014
Type: Proceedings
Publisher: ACM
Ying Zhang, Weinan Zhang, Bin Gao, Xiaojie Yuan, and Tie-Yan Liu
In sponsored search, many advertisers have not achieved their expected performances while the search engine also has a large room to improve their revenue. Specifically, due to the improper keyword bidding, many advertisers cannot survive the competitive ad auctions to get their desired ad impressions; meanwhile, a significant portion of search queries have no ads displayed in their search result pages, even if many of them have commercial values. We propose recommending a group of relevant yet...
Publication details
Date: 1 July 2014
Type: Article
Publisher: Elsevier
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
Yang Song, Xiaolin Shi, Ryen White, and Ahmed Hassan
Publication details
Date: 1 July 2014
Type: Inproceeding
Publisher: ACM
Cecily Morrison, Neil Smyth, Robert Corish, Kenton O'Hara, and Abigail Sellen
Computer visions (CV) systems are increasingly finding new roles in domains such as healthcare. These collaborative settings are a new challenge for CV systems, requiring the design of appropriate interaction paradigms. The provision of feedback, particularly of what the CV system can “see,” is a key aspect, and may not always be possible to present visually. We explore the design space for audio feedback for a scenario of interest, the clinical assessment of Multiple Sclerosis using a CV system. We then...
Publication details
Date: 25 June 2014
Type: Article
Ke Zhai and Jason Williams
A key challenge for computational models of conversation is to discover latent structure in dialogue. This is particularly true for task-oriented dialogues, where the latent structure provides a basis for analysing, evaluating, and building conversational systems. In this paper, we propose three new unsupervised dialogue models to discover latent structures in task-oriented dialogues. Our methods synthesize hidden Markov models (for underlying state) and topic models (to connect words to states). We apply...
Publication details
Date: 23 June 2014
Type: Inproceeding
Publisher: Association for Computational Linguistics
John Downs, Nicolas Villar, James Scott, Sian Lindley, John Helmes, and Gavin Smyth
We present Picco, a tiny situated display for drawings and simple animations, which are created on a dedicated tablet app. Picco was designed to support playful messaging in the workplace through a glanceable desktop device that would place minimal demands on users. Two studies of the device at work demonstrated how crafting was an expression of intimacy when the device was used to connect the workplace to the home, and a way of demonstrating skill and humor to a broad audience when messages were sent...
Publication details
Date: 21 June 2014
Type: Inproceeding
Publisher: ACM
Lenin Ravindranath, Sharad Agarwal, Jitu Padhye, and Chris Riederer
Generations of computer programmers are taught to prefetch network objects in computer science classes. In practice, prefetching can be harmful to the user's wallet when she is on a limited or pay-per-byte cellular data plan. Many popular, professionally-written smartphone apps today prefetch large amounts of network data that the typical user may never use. We present Procrastinator, which automatically decides when to fetch each network object that an app requests. This decision is made based on whether...
Publication details
Date: 16 June 2014
Type: Proceedings
Publisher: ACM International Conference on Mobile Systems, Applications, and Services
Moshe Babaioff and Eyal Winter
We study the complexity required for the implementation of multi-agent contracts under a variety of solution concepts. A contract is a mapping from strategy profiles to outcomes. Practical implementation of a contract requires it to be ”simple”, an illusive concept that needs to be formalized. A major source of complexity is the burden involving verifying the contract fulfillment (for example in a court of law). Contracts which specify a small number of outcomes are easier to verify and are less prone to...
Publication details
Date: 10 June 2014
Type: Inproceeding
Publisher: ACM
Moshe Babaioff, Brendan Lucier, Noam Nisan, and Renato Paes Leme
Central results in economics guarantee the existence of efficient equilibria for various classes of markets. An underlying assumption in early work is that agents are price-takers, i.e., agents honestly report their true demand in response to prices. A line of research in economics, initiated by Hurwicz (1972), is devoted to understanding how such markets perform when agents are strategic about their demands. This is captured by the \emph{Walrasian Mechanism} that proceeds by collecting reported demands,...
Publication details
Date: 10 June 2014
Type: Inproceeding
Publisher: ACM
Andrew Begel, Thomas Fritz, Sebastian Mueller, Serap Yigit-Elliott, and Manuela Zueger
Software developers make programming mistakes that cause serious bugs for their customers. Existing work to detect problematic software focuses mainly on post hoc identification of correlations between bug fixes and code. We propose a new approach to address this problem — detect when software developers are experiencing difficulty while they work on their programming tasks, and stop them before they can introduce bugs into the code. In this paper, we investigate a novel approach to classify the...
Publication details
Date: 4 June 2014
Type: Inproceeding
Publisher: International Conference on Software Engineering
Emre Kıcıman, Scott Counts, Michael Gamon, Munmun De Choudhury, and Bo Thiesson
Much research has focused on studying complex phenomena through its reflection in social media, from drawing neighborhood boundaries to inferring relationships between medicines and diseases. While it is generally recognized in the social sciences that such studies should be conditioned on gender, time and other confounding factors, few of the studies that attempt to extract information from social media actually condition on such factors. In this paper, we present a simple framework for specifying and...
Publication details
Date: 2 June 2014
Type: Inproceeding
Publisher: AAAI
Jung-Joo Lee, Siân Lindley, Salu Ylirisku, Giulio Jacucci, Tim Regan, and Marcus Nurminen
Publication details
Date: 1 June 2014
Type: Inproceeding
Publisher: ACM
Rakesh Agrawal, Maria Christoforaki, Sreenivas Gollapudi, Anitha Kannan, Krishnaram Kenthapadi, and Adith Swaminathan
We propose a system for mining videos from the web for supplementing the content of electronic textbooks in order to enhance their utility. Textbooks are generally organized into sections such that each section explains very few concepts and every concept is primarily explained in one section. Building upon these principles from the education literature and drawing upon the theory of Formal Concept Analysis, we define the focus of a section in terms of a few indicia, which themselves are combinations of...
Publication details
Date: 1 June 2014
Type: Inproceeding
Publisher: Springer
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 synchronized...
Publication details
Date: 1 June 2014
Type: Inproceeding
Publisher: IEEE
Andrew Putnam, Adrian Caulfield, Eric Chung, Derek Chiou, Kypros Constantinides, John Demme, Hadi Esmaeilzadeh, Jeremy Fowers, Jan Gray, Michael Haselman, Scott Hauck, Stephen Heil, Amir Hormati, Joo-Young Kim, Sitaram Lanka, James R. Larus, Eric Peterson, Gopi Prashanth, Aaron Smith, Jason Thong, Phillip Yi Xiao, and Doug Burger
Publication details
Date: 1 June 2014
Type: Inproceeding
Nikolai Tillmann, Judith Bishop, R. Nigel Horspool, Daniel Perelman, and Tao Xie
Learning to code can be made more effective and sustainable if it is perceived as fun by the learner. Code Hunt uses puzzles that play- ers have to explore by means of clues presented as test cases. Play- ers iteratively modify their code to match the functional behaviour of secret solutions. This way of learning to code is very different to learning from a specification. It is essentially re-engineering from test cases. Code Hunt is based on the test/clue generation of Pex, a white-box test generation...
Publication details
Date: 1 June 2014
Type: Article
Publisher: ACM ICSE Workshop on Seach Based Software Testing 2014
Nikolai Tillmann, Judith Bishop, Nigel Horspool, Daniel Perelman, and Tao Xie
Code Hunt - Searching for Secret Code for Fun
Publication details
Date: 1 June 2014
Type: Article
Adrian Sampson, Pavel Panchekha, Todd Mytkowicz, Kathryn S. McKinley, Dan Grossman, and Luis Ceze
Traditional assertions express correctness properties that must hold on every program execution. However, many applications have probabilistic outcomes and consequently their correctness properties are also probabilistic (e.g., they identify faces in images, consume sensor data, or run on unreliable hardware). Traditional assertions do not capture these correctness properties. This paper proposes that programmers express probabilistic correctness properties with probabilistic assertions and describes a new...
Publication details
Date: 1 June 2014
Type: Inproceeding
Publisher: Programming Language Design and Implementation (PLDI)
1–25 of 11427
Sort
Show 25 | 50 | 100
1234567Next 
> Our research