Abstract Searching for entities is an emerging task in Information Retrieval for which the goal is finding well defined entities instead of documents matching the query terms. In t...
Bodo Billerbeck, Gianluca Demartini, Claudiu S. Fi...
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications...
A sketch captures the most informative part of an object, in a much more concise and potentially robust representation (e.g., for face recognition or new capabilities of manipulat...
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...