The paper presents a new approach to the problem of paraphrase identification. The new approach extends a previously proposed method for the task of textual entailment. The relati...
Vasile Rus, Philip M. McCarthy, Mihai C. Lintean, ...
Harmonic analysis and diffusion on discrete data has been shown to lead to state-of-theart algorithms for machine learning tasks, especially in the context of semi-supervised and ...
Arthur D. Szlam, Mauro Maggioni, Ronald R. Coifman
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Graphs appear in several settings, like social networks, recommendation systems, computer communication networks, gene/protein biological networks, among others. A deep, recurring...
Ana Paula Appel, Andrew Tomkins, Christos Faloutso...
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, Ja...