Sciweavers

1000 search results - page 116 / 200
» Nominal rewriting systems
Sort
View
CORR
2006
Springer
88views Education» more  CORR 2006»
13 years 10 months ago
Polynomial Time Nondimensionalisation of Ordinary Differential Equations via their Lie Point Symmetries
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equation. ...
Evelyne Hubert, Alexandre Sedoglavic
CORR
2011
Springer
174views Education» more  CORR 2011»
13 years 4 months ago
Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
Georg Moser, Andreas Schnabl
ANLP
2000
126views more  ANLP 2000»
13 years 11 months ago
The Automatic Translation of Discourse Structures
We empirically show that there are significant differences between the discourse structure of Japanese texts and the discourse structure of their corresponding English translation...
Daniel Marcu, Lynn Carlson, Maki Watanabe
SYRCODIS
2008
184views Database» more  SYRCODIS 2008»
13 years 11 months ago
Towards Cost-based Query Optimization in Native XML Database Management Systems
In the last few years, XML became a de-facto standard for the exchange of structured and semi-structured data. The database research community took this development into account b...
Andreas M. Weiner, Christian Mathis, Theo Här...
RR
2010
Springer
13 years 8 months ago
Query-Based Access Control for Ontologies
Role-based access control is a standard mechanism in information systems. Based on the role a user has, certain information is kept from the user even if requested. For ontologies ...
Martin Knechtel, Heiner Stuckenschmidt