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.
Unlike existing studies dealing with the selection of Bitmap Join Indexes for star join queries optimization, this paper presents three original features. The first one consists in addressing the problem with ant based approach that is more robust than the simple heuristic algorithms, which are usually used in the related works. The second interesting novelty resides in the metric used to prune the...
In this paper we present the KGRAM abstract machine dedicated to querying knowledge graphs. It is the result of an abstraction process we performed to reach a generic solution to the problem of querying graphs in various models. We identified high level abstract primitives that constitute the expressions of the query language and the interfaces of KGRAM for both its data structures and its operations.
The ESP game belongs to the genre called Games with a Purpose (GWAP), which leverage people's desire to be entertained and also outsource certain steps of the computational process to humans. The productivity of ESP-like GWAP systems depends to a great extent on the puzzle selection strategy used in the system. Although traditional approaches seek to determine the optimal number of agreements reached...
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dimensional data in an optimal low-dimensional subspace, which is learned with a few user supplied constraints as well as the structure of input data. We study two types of constraints that indicate whether or not pairs of...
Distributed Constraint Optimization Problem (DCOP) is a framework that recently emerged as one of the most successful approaches for coordination in Multi-Agent system. Dynamic Programming Optimization (DPOP) is an algorithm which requires only a linear number of messages, thus introducing exponentially less network overhead than other search algorithms when applied in a distributed setting. In DPOP...
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.