Identifying highlights in multimedia content such as video and audio is currently a very difficult technical problem. We present and evaluate a novel algorithm that identifies hig...
We study online social networks in which relationships can be either positive (indicating relations such as friendship) or negative (indicating relations such as opposition or ant...
Jure Leskovec, Daniel P. Huttenlocher, Jon M. Klei...
We propose a novel method, based on concepts from expander graphs, to sample communities in networks. We show that our sampling method, unlike previous techniques, produces subgra...
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
Social networking services well know that some users are unwilling to freely share the information they store with the service (e.g. profile information). To address this, servic...