Inspired by the Google Wonder Wheel1 , in this paper we present Semantic Wonder Cloud (SWOC): a tool that helps users in knowledge exploration within the DBpedia dataset by adoptin...
Roberto Mirizzi, Azzurra Ragone, Tommaso Di Noia, ...
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
We consider activity-centered tasks in email, including the novel task of predicting future involvement of persons from an enterprise in an ongoing activity represented by a folde...
Einat Minkov, Ramnath Balasubramanyan, William W. ...
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Link farm spam and replicated pages can greatly deteriorate link-based ranking algorithms like HITS. In order to identify and neutralize link farm spam and replicated pages, we lo...