Sciweavers

1000 search results - page 104 / 200
» Dependency Tree Automata
Sort
View
LICS
2005
IEEE
15 years 6 months ago
Temporal Logics over Unranked Trees
We consider unranked trees, that have become an active subject of study recently due to XML applications, and characterize commonly used fragments of firstorder (FO) and monadic ...
Pablo Barceló, Leonid Libkin
140
Voted
VECPAR
2004
Springer
15 years 6 months ago
Dynamically Adaptive Binomial Trees for Broadcasting in Heterogeneous Networks of Workstations
Binomial trees have been used extensively for broadcasting in clusters of workstations. In the case of heterogeneous nondedicated clusters and grid environments, the broadcasting o...
Silvia M. Figueira, Christine Mendes
96
Voted
ENTCS
2007
143views more  ENTCS 2007»
15 years 23 days ago
Formal Fault Tree Analysis - Practical Experiences
Safety is an important requirement for many modern systems. To ensure safety of complex critical systems, well-known safety analysis methods have been formalized. This holds in pa...
Frank Ortmeier, Gerhard Schellhorn
96
Voted
COR
2004
111views more  COR 2004»
15 years 20 days ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
126
Voted
NETWORKS
2010
14 years 11 months ago
Fixed-parameter tractability results for full-degree spanning tree and its dual
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke