Sciweavers

1805 search results - page 19 / 361
» A Theory of Closure Operators
Sort
View
ICDT
2010
ACM
180views Database» more  ICDT 2010»
15 years 7 months ago
Composing local-as-view mappings: closure and applications
Schema mapping composition is a fundamental operation in schema management and data exchange. The mapping composition problem has been extensively studied for a number of mapping ...
Patricia C. Arocena, Ariel Fuxman, Renée J....
115
Voted
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 2 months ago
Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata
nalysis of a TA modeled component. First, we abstract fine models to work with event streams at coarse granularity. We perform analysis of the component at multiple coarse granular...
Karine Altisen, Yanhong Liu, Matthieu Moy
ML
2010
ACM
210views Machine Learning» more  ML 2010»
15 years 2 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
SOFSEM
1998
Springer
15 years 8 months ago
Some Results on the Modelling of Spatial Data
Abstract. Formal methods based on the mathematical theory of partially ordered sets (i.e., posets) have been used in the database field for the modelling of spatial data since many...
Luca Forlizzi, Enrico Nardelli
STACS
1994
Springer
15 years 8 months ago
Reachability and the Power of Local Ordering
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
Kousha Etessami, Neil Immerman