1503 search results - page 112 / 301 » Self-optimizing distributed trees |
GLOBECOM
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
ISPDC
2006
IEEE
14 years 4 months ago
2006
IEEE
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
ASPDAC
2006
ACM
14 years 4 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
EUROPAR
2004
Springer
14 years 3 months ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
ECML
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that...