Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Our research
Content type
+
Downloads (455)
+
Events (487)
 
Groups (150)
+
News (2850)
 
People (720)
 
Projects (1160)
+
Publications (13024)
+
Videos (6121)
Labs
Research areas
Algorithms and theory47205 (376)
Communication and collaboration47188 (251)
Computational linguistics47189 (275)
Computational sciences47190 (247)
Computer systems and networking47191 (848)
Computer vision208594 (953)
Data mining and data management208595 (168)
Economics and computation47192 (129)
Education47193 (91)
Gaming47194 (85)
Graphics and multimedia47195 (265)
Hardware and devices47196 (243)
Health and well-being47197 (117)
Human-computer interaction47198 (1018)
Machine learning and intelligence47200 (1032)
Mobile computing208596 (89)
Quantum computing208597 (45)
Search, information retrieval, and knowledge management47199 (756)
Security and privacy47202 (372)
Social media208598 (93)
Social sciences47203 (319)
Software development, programming principles, tools, and languages47204 (688)
Speech recognition, synthesis, and dialog systems208599 (176)
Technology for emerging markets208600 (64)
1–25 of 13024
Sort
Show 25 | 50 | 100
1234567Next 
Ricardo L. de Queiroz and Philip A. Chou

In free-viewpoint video, there is a recent trend to represent scene objects as solids rather than using multiple depth maps. Point clouds have been used in computer graphics for a long time and with the recent possibility of real time capturing and rendering, point clouds have been favored over meshes in order to save computation. Each point in the cloud is associated with its 3D position and its color. We devise a method to compress the colors in point clouds which is based on a hierarchical transform...

Publication details
Date: 1 December 2016
Type: Article
Publisher: IEEE – Institute of Electrical and Electronics Engineers
Rishabh Singh

The recent Programming By Example (PBE) techniques such as FlashFill have shown great promise for enabling end-users to perform data transformation tasks using input-output examples. Since examples are inherently an under-specification, there are typically a large number of hypotheses conforming to the examples, and the PBE techniques suffer from scalability issues for finding the intended program amongst the large space.

We present a semi-supervised learning technique to significantly reduce...

Publication details
Date: 1 September 2016
Type: Inproceeding
Publisher: VLDB – Very Large Data Bases
Samuel Haney, Ashwin Machanavajjhala, and Bolin Ding

The problem of designing error optimal differentially private algorithms is well studied. Recent work applying differential privacy to real world settings have used variants of differential privacy that appropriately modify the notion of neighboring databases. The problem of designing error optimal algorithms for such variants of differential privacy is open. In this paper, we show a novel transformational equivalence result that can turn the problem of query answering under differential privacy with a...

Publication details
Date: 1 September 2016
Type: Article
Publisher: VLDB – Very Large Data Bases
Philip A. Chou and Ricardo L. de Queiroz

We introduce the Gaussian Process Transform (GPT), an orthogonal transform for signals defined on a finite but otherwise arbitrary set of points in a Euclidean domain. The GPT is obtained as the e Transform (KLT) of the marginalization of a Gaussian Process defined on the domain. Compared to the Graph Transform (GT), which is the KLT of a Gauss Markov Random Field over the same set of points whose neighborhood structure is inherited from the Euclidean domain, the GPT has up to 6 dB higher coding...

Publication details
Date: 1 September 2016
Type: Inproceeding
Publisher: IEEE – Institute of Electrical and Electronics Engineers
Wen-tau Yih, Matthew Richardson, Christopher Meek, Ming-Wei Chang, and Jina Suh
Publication details
Date: 1 August 2016
Type: Inproceeding
Publisher: ACL – Association for Computational Linguistics
Zhongyuan Wang and Haixun Wang

Billions of short texts are produced everyday, in the form of search queries, ad keywords, tags, tweets, messenger conversations, social network posts, etc. Unlike documents, short texts have some unique characteristics which make them difficult to handle. First, short texts, especially search queries, do not always observe the syntax of a written language. This means traditional NLP techniques, such as syntactic parsing, do not always apply to short texts. Second, short texts contain limited context....

Publication details
Date: 1 August 2016
Type: Inproceeding
Konstantina Christakopoulou, Filip Radlinski, and Katja Hofmann

People often ask others for restaurant recommendations as a way to discover new dining experiences. This makes restaurant recommendation an exciting scenario for recommender systems and has led to substantial research in this area. However, most such systems behave very differently from a human when asked for a recommendation. The goal of this paper is to begin to reduce this gap.

In particular, humans can quickly establish preferences when asked to make a recommendation for someone they do not...

Publication details
Date: 1 August 2016
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Junchen Jiang, Rajdeep Das, Ganesh Ananthanarayanan, Philip A. Chou, Venkata Padmanabhan, Vyas Sekar, Esbjorn Dominique, Marcin Goliszewski, Dalibor Kukoleca, Renat Vafin, and Hui Zhang

The use of the public Internet for voice calls is here to stay. In spite of the volume and importance of Internet telephony, we have little understanding of (1) how network performance impacts user-perceived voice call quality, and (2) why and where such quality problems occur in the wild. To bridge this gap, we analyze a data set of 88 million calls from a large VoIP provider with clients spread across 1900 ASes and 126 countries. One of the key findings is that calls over bad networks are spread out...

Publication details
Date: 1 August 2016
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Ji He, Jianshu Chen, Xiaodong He, Jianfeng Gao, Lihong Li, Li Deng, and Mari Ostendorf
Publication details
Date: 1 August 2016
Type: Inproceeding
Publisher: ACL – Association for Computational Linguistics
Peter Bailey and Nick Craswell

Why do people start a search? Why do they stop? Why do they do what they do in-between? Our goal in this paper is to provide a simple yet general explanation for these acts that has its basis in neuropsychology and observed user behavior. We coin the term “ingram”, as an information counterpart to Richard Semon's “engram” or "memory trace". People search to create ingrams. People stop searching because they have created sufficient ingrams, or given up. We describe these acts through a pair of user...

Publication details
Date: 17 July 2016
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Peter Bailey, Alistair Moffat, Falk Scholer, and Paul Thomas

We describe the UQV100 test collection, designed to incorporate variability from users. Information need “backstories” were written for 100 topics (or sub-topics) from the TREC 2013 and 2014 Web Tracks. Crowd workers were asked to read the backstories, and provide the queries they would use; plus effort estimates of how many useful documents they would have to read to satisfy the
need. A total of 10;835 queries were collected from 263 workers. After normalization and spell-correction, 5;764 unique...

Publication details
Date: 17 July 2016
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Ganesh Jawahar, Manish Gupta, and Vasudeva Varma

Doc2Sent2Vec is an unsupervised approach to learn low-dimensional feature vector (or embedding) for a document. This embedding captures the semantics of the document and can be fed as input to machine learning algorithms to solve a myriad number of applications in the field of data mining and information retrieval. Some of these applications include document classification, retrieval, and ranking.

The proposed approach is two-phased. In the first phase, the model learns a vector for each sentence...

Publication details
Date: 17 July 2016
Type: Inproceeding
Jorge Proença, Dirce Celorico, Carla Lopes, Miguel Sales Dias, Michael Tjalve, Andreas Stolcke, Sara Candeias, and Fernando Perdigão

To evaluate the reading performance of children, human assessment is usually involved, where a teacher or tutor has to take time to individually estimate the performance in terms of fluency (speed, accuracy and expression). Automatic estimation of reading ability can be an important alternative or complement to the usual methods, and can improve other applications such as elearning. Techniques must be developed to analyse audio recordings of read utterances by children and detect the deviations from the...

Publication details
Date: 1 July 2016
Type: Inproceeding
Publisher: ACL – Association for Computational Linguistics
Aleksandar Zeljic, Christoph M. Wintersteiger, and Philipp Rummer

The Model-Constructing Satisfiability Calculus (mcSAT) is a recently proposed generalisation of propositional DPLL/CDCL for reasoning modulo theories. In contrast to most DPLL(T)-based SMT solvers, which carry out con ict-driven learning only on the propositional level, mcSAT calculi can also synthesise new theory literals during learning, resulting in a simple yet very exible framework for designing efficient decision procedures. We present an mcSAT calculus for the theory of bounded-length...

Publication details
Date: 1 July 2016
Type: Inproceeding
Publisher: Springer
Matthew Johnson, Katja Hofmann, Tim Hutton, and David Bignell

We present Project Malmo – an AI experimentation platform built on top of the popular computer game Minecraft, and designed to support fundamental research in artificial intelligence. As the AI research community pushes for artificial general intelligence (AGI), experimentation platforms are needed that support the development of flexible agents that learn to solve diverse tasks in complex environments. Minecraft is an ideal foundation for such a platform, as it exposes agents to complex 3D worlds,...

Publication details
Date: 1 July 2016
Type: Inproceeding
Publisher: AAAI - Association for the Advancement of Artificial Intelligence
Masrour Zoghi, Tomáš Tunys, Lihong Li, Damien Jose, Junyan Chen, Chun Ming Chin, and Maarten de Rijke
Publication details
Date: 1 July 2016
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Loris D'Antoni, Roopsha Samanta, and Rishabh Singh

The goal of automatic program repair is to identify a set of syntactic changes
that can turn a program that is incorrect with respect to a given specification into a correct one.
Existing program repair techniques typically
aim to find any program that meets the given specification.
Such ``best-effort'' strategies can end up generating a program that is quite different
from the original one.
Novel techniques have been proposed to compute syntactically minimal program...

Publication details
Date: 1 July 2016
Type: Inproceeding
Loris D'Antoni and Margus Veanes

Symbolic tree automata allow transitions to carry predicates over rich alphabet theories, such as linear arithmetic, and therefore extend finite tree automata to operate over infinite alphabets, such as the set of rational numbers. Existing tree automata algorithms rely on the alphabet being finite, and generalizing them to the sym bolic setting is not a trivial task.

In this paper we study the problem of minimizing symbolic tree automata. First, we formally define and prove the basic prope rties...

Publication details
Date: 1 July 2016
Type: Inproceeding
Publisher: IEEE – Institute of Electrical and Electronics Engineers
Publication details
Date: 1 July 2016
Type: Inproceeding
A. Bocharov, S. X. Cui, M. Roetteler, and K. M. Svore

Qutrit (or ternary) structures arise naturally in many quantum systems, particularly in certain non-abelian anyon systems. We present efficient circuits for ternary reversible and quantum arithmetics. Our main result is the derivation of circuits for two families of ternary quantum adders, namely ripple carry adders and carry look-ahead adders. The main difference to the binary case is the more complicated form of the ternary carry, which leads to higher resource counts for implementations over a...

Publication details
Date: 1 July 2016
Type: Article
Publisher: Rinton Press
Number: 9&10
Mingsong Dou, Sameh Khamis, Yury Degtyarev, Philip Davidson, Sean Fanello, Adarsh Kowdle, Sergio Orts Escolano, Christoph Rhemann, David Kim, Jonathan Taylor, Pushmeet Kohli, Vladimir Tankovich, and Shahram Izadi
Publication details
Date: 1 July 2016
Type: Inproceeding
Publisher: SIGGRAPH
Dong Liu, Lizhi Wang, Li Li, Zhiwei Xiong, Feng Wu, and Wenjun Zeng
Publication details
Date: 1 July 2016
Type: Inproceeding
Publisher: IEEE – Institute of Electrical and Electronics Engineers
Yang Song, Ali Elkahky, and Xiaodong He

Modeling temporal behavior in recommendation systems is an important and challenging problem. Its challenges come from the fact that temporal modeling increases the cost of parameter estimation and inference, while requires large amount of data to reliably learn the model with additional time dimensions. Therefore, it is hard to model temporal behavior in large scale real-world recommendation applications.

In this work, we propose a new deep neural network based architecture that models the...

Publication details
Date: 1 July 2016
Type: Inproceeding
Publisher: ACM – Association for Computing Machinery
Xiuwen Yi, Yu Zheng, Junbo Zhang, and Tianrui Li

Many sensors have been deployed in the physical world, generating massive geo-tagged time series data. In reality, we usually lose readings of sensors at some unexpected moments because of sensor or communication errors. Those missing rea­dings do not only affect real-time monitoring but also com­promise the performance of further data analysis. In this paper, we propose a spatio-temporal multi-view-based learning (ST-MVL) method to collec­tively fill missing readings in a collection of...

Publication details
Date: 1 July 2016
Type: Inproceeding
Publisher: AAAI - Association for the Advancement of Artificial Intelligence
Moshe Babaioff, Liad Blumrosen, and Noam Nisan

We consider a network of sellers, each selling a single product, where the graph structure represents pair-wise complementarities between products. We study how the network structure affects revenue and social welfare of equilibria of the pricing game between the sellers. We prove positive and negative results, both of "Price of Anarchy" and of "Price of Stability" type, for special families of graphs (paths, cycles) as well as more general ones (trees, graphs). We describe best-reply dynamics that...

Publication details
Date: 1 July 2016
Type: Inproceeding
1–25 of 13024
Sort
Show 25 | 50 | 100
1234567Next 
> Our research