Sciweavers

2273 search results - page 25 / 455
» On the Expressiveness and Complexity of ATL
Sort
View
ILP
2003
Springer
14 years 1 months ago
Complexity Parameters for First-Order Classes
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
Marta Arias, Roni Khardon
CORR
2011
Springer
183views Education» more  CORR 2011»
13 years 3 months ago
Pattern tree-based XOLAP rollup operator for XML complex hierarchies
—With the rise of XML as a standard for representing business data, XML data warehousing appears as a suitable solution for decision-support applications. In this context, it is ...
Marouane Hachicha, Jérôme Darmont
ADBIS
2010
Springer
145views Database» more  ADBIS 2010»
13 years 6 months ago
Faceoff: Surrogate vs. Natural Keys
Abstract. The natural and surrogate key architectures are two competing approaches to specifying keys in relational databases. We analyze the performance of these approaches with r...
Slavica Aleksic, Milan Celikovic, Sebastian Link, ...
LPAR
2007
Springer
14 years 2 months ago
The Complexity of Temporal Logic with Until and Since over Ordinals
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
Stéphane Demri, Alexander Rabinovich
PPOPP
1995
ACM
13 years 12 months ago
pC++/streams: a Library for I/O on Complex Distributed Data Structures
paper we describe d/streams, a language-independent abstraction with a small set of simple primitives for buffered I/O on distributed data-structures. We describe the interface an...
Jacob Gotwals, Suresh Srinivas, Dennis Gannon