Sciweavers

20441 search results - page 3713 / 4089
» Locally Computable Structures
Sort
View
LACL
1998
Springer
15 years 8 months ago
Strict Compositionality and Literal Movement Grammars
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
Marcus Kracht
POS
1998
Springer
15 years 8 months ago
Spatio-temporal Access in Persistent Java
Persistent programming languages are targetted primarily at application systems involving complex data structures and relationships, as typi ed by Geographical Information Systems...
Sonia Berman, R. Southern, A. Vasey, D. Ziskind
VLDB
1998
ACM
149views Database» more  VLDB 1998»
15 years 8 months ago
Incremental Maintenance for Materialized Views over Semistructured Data
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
Serge Abiteboul, Jason McHugh, Michael Rys, Vasili...
CP
1997
Springer
15 years 8 months ago
Ordering Constraints over Feature Trees
Feature trees have been used to accommodate records in constraint programming and record like structures in computational linguistics. Feature trees model records, and feature cons...
Martin Müller, Joachim Niehren, Andreas Podel...
LICS
1996
IEEE
15 years 8 months ago
The Theory of Hybrid Automata
Ahybrid automatonis a formalmodelfor a mixeddiscrete-continuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically...
Thomas A. Henzinger
« Prev « First page 3713 / 4089 Last » Next »