Sciweavers

76 search results - page 10 / 16
» Minimum Spanning Tree on Spatio-Temporal Networks
Sort
View
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
14 years 1 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
ICDCSW
2003
IEEE
14 years 1 months ago
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
Qing Dai, Jie Wu
CATA
2004
13 years 10 months ago
Optimal Trees for the Parametric Fixed Charge Shortest Paths Problem
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Fred J. Rispoli, Steven Cosares
CORR
2008
Springer
167views Education» more  CORR 2008»
13 years 8 months ago
Energy Scaling Laws for Distributed Inference in Random Networks
The energy scaling laws of multihop data fusion networks for distributed inference are considered. The fusion network consists of randomly located sensors independently distributed...
Animashree Anandkumar, Joseph E. Yukich, Lang Tong...
ICCAD
2006
IEEE
132views Hardware» more  ICCAD 2006»
14 years 2 months ago
Clock buffer polarity assignment for power noise reduction
Abstract—Power/ground noise is a major source of VLSI circuit timing variations. This work aims to reduce clock network induced power noise by assigning different signal polariti...
Rupak Samanta, Ganesh Venkataraman, Jiang Hu