Sciweavers

502 search results - page 34 / 101
» Verifying Balanced Trees
Sort
View
ICPADS
2005
IEEE
14 years 4 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
CORR
2006
Springer
88views Education» more  CORR 2006»
13 years 11 months ago
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
Wim Martens, Frank Neven, Marc Gyssens
MDM
2009
Springer
149views Communications» more  MDM 2009»
14 years 5 months ago
ETC: Energy-Driven Tree Construction in Wireless Sensor Networks
Continuous queries in Wireless Sensor Networks (WSNs) are founded on the premise of Query Routing Tree structures (denoted as T), which provide sensors with a path to the querying...
Panayiotis Andreou, A. Pamboris, Demetrios Zeinali...
NETWORKING
2007
14 years 11 days ago
Construction of a Proxy-Based Overlay Skeleton Tree for Large-Scale Real-Time Group Communications
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
Jun Guo, Sanjay Jha
ISCAS
2006
IEEE
70views Hardware» more  ISCAS 2006»
14 years 5 months ago
Quadrature mismatch shaping with a complex, tree structured DAC
— Quadrature Σ∆ ADCs require a feedback path for both the I and the Q part of the complex feedback signal. If two separated multibit feedback DACs are used, mismatch among the...
Stijn Reekmans, Jeroen De Maeyer, Pieter Rombouts,...