Sciweavers

1224 search results - page 193 / 245
» Theory decision by decomposition
Sort
View
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 11 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
PODS
2008
ACM
141views Database» more  PODS 2008»
14 years 11 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
LATA
2010
Springer
14 years 8 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
SDM
2009
SIAM
191views Data Mining» more  SDM 2009»
14 years 8 months ago
Adaptive Concept Drift Detection.
An established method to detect concept drift in data streams is to perform statistical hypothesis testing on the multivariate data in the stream. Statistical decision theory off...
Anton Dries, Ulrich Rückert
SOFSEM
2009
Springer
14 years 8 months ago
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
Abstract. Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multiagent systems despite private information, self-i...
David C. Parkes