In this paper, we propose to extend XQuery - the XML query language - with a set of transformation operators which will produce a copy of an XML tree in which some subtrees will b...
Emmanuel Bruno, Jacques Le Maitre, Elisabeth Muris...
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
: Reported is the methodology of the semantic transformation of an initial user’s search query in the form of key words or key phrases to the resulting query composed of the rele...
Existing estimation approaches for spatial databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, the...
In this paper we propose a completely unsupervised method for open-domain entity extraction and clustering over query logs. The underlying hypothesis is that classes defined by mi...