13 search results - page 2 / 3 » A Backward and a Forward Simulation for Weighted Tree Automa... |
LICS
2007
IEEE
13 years 10 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
ASMTA
2008
Springer
13 years 6 months ago
2008
Springer
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
RTA
2005
Springer
13 years 9 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
SIGMOD
2008
ACM
13 years 4 months ago
2008
ACM
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
ICC
2008
IEEE
13 years 10 months ago
2008
IEEE
—Most research on P2P multimedia streaming assumes that users access video content sequentially and passively. Unlike P2P live streaming in which the peers start playback from th...