We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Abstract. This paper introduces a method to generate efficient vectorized implementations of small stride permutations using only vector load and vector shuffle instructions. These...
This paper presents a system for querying treebanks in a uniform way. The system is able to work with both dependency and constituency based treebanks in any language. We demonstr...
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...
Xiaopeng Xi, Eamonn J. Keogh, Li Wei, Agenor Mafra...
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...