Sciweavers

2713 search results - page 108 / 543
» Parameterized Tree Systems
Sort
View
119
Voted
STOC
2005
ACM
115views Algorithms» more  STOC 2005»
16 years 3 months ago
Lower-stretch spanning trees
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
Michael Elkin, Yuval Emek, Daniel A. Spielman, Sha...
NBIS
2007
Springer
15 years 9 months ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero
SAFECOMP
2005
Springer
15 years 9 months ago
Generalising Event Trees Using Bayesian Networks with a Case Study of Train Derailment
Event trees are a popular technique for modelling accidents in system safety analyses. Bayesian networks are a probabilistic modelling technique representing influences between unc...
George Bearfield, William Marsh
146
Voted
BROADNETS
2006
IEEE
15 years 9 months ago
Optimizing IP Multicast through Delayed Multicast Tree Pruning
This paper studies the system parameters that affect the total cost of managing the multicast group on a router. A Petri net model is first proposed to describe the states and tra...
Yongjun Li, Wenhui Zhou, James Zijun Wang, Deyu Qi
121
Voted
IFIP
2004
Springer
15 years 8 months ago
Regular Tree Language Recognition with Static Information
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
Alain Frisch