Sciweavers

1418 search results - page 238 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
138
Voted
ICDT
2007
ACM
141views Database» more  ICDT 2007»
15 years 11 months ago
Exact XML Type Checking in Polynomial Time
Stay macro tree transducers (smtts) are an expressive formalism for reasoning about XSLT-like document transformations. Here, we consider the exact type checking problem for smtts....
Sebastian Maneth, Thomas Perst, Helmut Seidl
CBMS
2006
IEEE
15 years 11 months ago
An Ontology-Driven Mediator for Querying Time-Oriented Biomedical Data
— Most biomedical research databases contain considerable amounts of time-oriented data. However, temporal knowledge about the contextual meaning of such data is not usually repr...
Martin J. O'Connor, Ravi Shankar, Amar K. Das
DALT
2005
Springer
15 years 10 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
143
Voted
ECMDAFA
2005
Springer
122views Hardware» more  ECMDAFA 2005»
15 years 10 months ago
Semantic Anchoring with Model Transformations
Model-Integrated Computing (MIC) is an approach to Model-Driven Architecture (MDA), which has been developed primarily for embedded systems. MIC places strong emphasis on the use o...
Kai Chen 0003, Janos Sztipanovits, Sherif Abdelwah...
146
Voted
FC
2005
Springer
142views Cryptology» more  FC 2005»
15 years 10 months ago
Testing Disjointness of Private Datasets
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...
Aggelos Kiayias, Antonina Mitrofanova