Sciweavers

1418 search results - page 55 / 284
» The Dynamic Complexity of Formal Languages
Sort
View
POPL
2008
ACM
16 years 6 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
PODS
2008
ACM
141views Database» more  PODS 2008»
16 years 6 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
DLOG
2006
15 years 7 months ago
Data Complexity of Answering Unions of Conjunctive Queries in SHIQ
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
OTM
2005
Springer
15 years 11 months ago
Document Flow Model: A Formal Notation for Modelling Asynchronous Web Services Composition
This paper presents a formal notation for modelling asynchronous web services composition, using context and coordination mechanisms. Our notation specifies the messages that can b...
Jingtao Yang, Corina Cîrstea, Peter Henderso...
DBSEC
2010
152views Database» more  DBSEC 2010»
15 years 7 months ago
Modelling Dynamic Access Control Policies for Web-Based Collaborative Systems
Abstract. We present a modelling language, called X-Policy, for webbased collaborative systems with dynamic access control policies. The access to resources in these systems depend...
Hasan Qunoo, Mark Ryan