The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We introduce succinct representations of a d-dimensional point setsupporting orthogonal range searching under two circumstances. First, we discuss this problem under the assumptionthat each coordinate of points takes a real number and we cannot change its encoding. In this case, it is usual to convert the point set into rank space. In this paper, we present a data structureusing dn lg n + o(n lg n)...
In this work we propose a novel approach for RDF (Resource Description Framework) dictionary encoding that employs a parallel RDF parser and a distributed dictionary data structure, exploiting RDF-specific optimizations. In contrast with previous solutions, this approach exploits the Partitioned Global Address Space (PGAS) programming model combined with active messages. We evaluate the performance...
In today's rapidly evolving and growing online community many different applications are proposed and implemented. One category of such applications that drew high attention during the last few years are the so-called Voting Advice Applications (VAAs). VAAs are online systems used during elections that allow voters to create a political profile, the comparison of this profile with the profiles of...
Software-as-a-Service applications commonly consolidate multiple businesses into the same database to reduce costs. This practice makes it harder to implement several essential features of enterprise applications. The first is support for master data, which should be shared rather than replicated for each tenant. The second is application modification and extension, which applies both to the database...
Statistical-based Bayesian filters have become a popular and important defense against spam. However, despite their effectiveness, their greater processing overhead can prevent them from scaling well for enterprise level mail servers. For example, the dictionary lookups that are characteristic of this approach are limited by the memory access rate, therefore relatively insensitive to increases in...
In this paper, we consider two kinds of unordered tree matchings for evaluating tree pattern queries in XML databases. For the first kind of unordered tree matching, we propose a new algorithm, which runs in O(|D||Q|) time, where Q is a tree pattern and D is a largest data stream associated with a node of Q. It can also be adapted to an indexing environment with XB-trees being used to speed up disk...
In recent years, cross-domain learning algorithms have attracted much attention to solve labeled data insufficient problem. However, these cross-domain learning algorithms cannot be applied for subspace learning, which plays a key role in multimedia, e. g., Web image annotation. This paper envisions the cross-domain discriminative subspace learning and provides an effective solution to cross-domain...
Combining classifier methods have shown their effectiveness in a number of applications. Nonetheless, using simultaneously multiple classifiers may result in some cases in a reduction of the overall performance, since the responses provided by some of the experts may generate consensus on a wrong decision even if other experts provided the correct one. To reduce these undesired effects, in a previous...
Dozens of high level representations of time series have been introduced for data mining in the literature. But the problem of the discretization of the original data into symbolic strings is not been well solved. However, in spite of there are dozens of techniques for producing different variants of the symbolic representation, there still have no excellent method to calculate the distance in the...
Statistical graphs are ubiquitous mechanisms for data visualization such that most, if not all, enterprises communicate information through them. However, many graphs are stored as unstructured images or proprietary binary objects, making them difficult to work with beyond the reports in which they are embedded. While graphs can be mapped to more common XML representations, these lack expressive semantics...
We consider the notion of a (data) format where each format defines a family of data structures. These formats arose from the theory of databases. Previous works have investigated the notion of generic transformations of data structures between formats. We give a novel grouptheoretic view of genericity which unifies the original approaches of Hull-Yap and Aho-Ullman. Among the results are: A necessary...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.