Sciweavers

7106 search results - page 238 / 1422
» Restricted Complexity, General Complexity
Sort
View
PODS
2005
ACM
129views Database» more  PODS 2005»
16 years 4 months ago
Regular rewriting of active XML and unambiguity
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
Serge Abiteboul, Tova Milo, Omar Benjelloun
ISAAC
2009
Springer
147views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets
Abstract. We investigate the computational complexity of a new combinatorial problem of inferring a smallest possible multi-labeled phylogenetic tree (MUL tree) which is consistent...
Sylvain Guillemot, Jesper Jansson, Wing-Kin Sung
JCDL
2009
ACM
115views Education» more  JCDL 2009»
15 years 10 months ago
Using timed-release cryptography to mitigate the preservation risk of embargo periods
Due to temporary access restrictions, embargoed data cannot be refreshed to unlimited parties during the embargo time interval. A solution to mitigate the risk of data loss has be...
Rabia Haq, Michael L. Nelson
FOSSACS
2010
Springer
15 years 10 months ago
Reachability Analysis of Communicating Pushdown Systems
Abstract. The reachability analysis of recursive programs that communicate asynchronously over reliable Fifo channels calls for restrictions to ensure decidability. We extend here ...
Alexander Heußner, Jérôme Lerou...
CDC
2008
IEEE
152views Control Systems» more  CDC 2008»
15 years 10 months ago
Non-uniform small-gain theorems for systems with unstable invariant sets
— We consider the problem of small-gain analysis of asymptotic behavior in interconnected nonlinear dynamic systems. Mathematical models of these systems are allowed to be uncert...
Ivan Tyukin, Erik Steur, Henk Nijmeijer, Cees van ...