Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
We describe a framework for automatically selecting a summary set of photographs from a large collection of geo-referenced photos. The summary algorithm is based on spatial patter...
Alexander Jaffe, Mor Naaman, Tamir Tassa, Marc Dav...
Collaborative tagging systems are now popular tools for organising and sharing information on the Web. While collaborative tagging offers many advantages over the use of controll...
Ching-man Au Yeung, Nicholas Gibbins, Nigel Shadbo...
We present HAMLET, a suite of principles, scoring models and algorithms to automatically propagate metadata along edges in a document neighborhood. As a showcase scenario we consi...
Adriana Budura, Sebastian Michel, Philippe Cudr&ea...
One of the main problems in online advertising is to display ads which are relevant and appropriate w.r.t. what the user is looking for. Often search engines fail to reach this go...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...