Mashups are a new kind of interactive Web application, built out of the composition of two or more existing Web service APIs and data sources. Whereas “pure” mashups are built ...
The current Information Retrieval Systems return hundreds or thousands of documents in response to a query. Users consider only the first 20 or 30, but documents are often sorted a...
David Bueno, Ricardo Conejo, Amos David, Cristina ...
Instance-based learning algorithms are widely used due to their capacity to approximate complex target functions; however, the performance of this kind of algorithms degrades signi...
In this paper, we discuss tree kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees, in which every node might...
Abstract. Most existing methods for determining localization of the image feature point are still inefficient in terms of the precision. In the paper, we propose a new algorithm fo...