4137 search results - page 260 / 828 » On the number of matchings of a tree |
172
Voted
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
174
click to vote
ISM
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a set of techniques to simplify tree models for faster rendering while retaining their visual resemblance to the original model. This goal is achieved by setting a budg...
196
click to vote
DSN
2007
IEEE
16 years 1 months ago
2007
IEEE
Dynamic Fault Trees (DFT) extend standard fault trees by allowing the modeling of complex system components’ behaviors and interactions. Being a high level model and easy to use...
160
click to vote
ICAS
2005
IEEE
16 years 10 days ago
2005
IEEE
— This paper presents a novel approach for efficient tree construction in ALM (Application Layer Multicast) using layered video coding. This system is suitable for the users in h...
182
click to vote
WSCG
2003
15 years 8 months ago
2003
In this paper, a recursive algorithm that can build complex tree structure quickly is presented briefly. The plant structural growth is based on a dual-scale automaton, in which â...