Sciweavers

1027 search results - page 194 / 206
» Ordered Vertex Partitioning
Sort
View
IPSN
2005
Springer
14 years 1 months ago
Matched source-channel communication for field estimation in wireless sensor networks
Abstract— Sensing, processing and communication must be jointly optimized for efficient operation of resource-limited wireless sensor networks. We propose a novel source-channel...
Waheed Uz Zaman Bajwa, Akbar M. Sayeed, Robert D. ...
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
14 years 29 days ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail
PADS
2004
ACM
14 years 28 days ago
Space-Parallel Network Simulations Using Ghosts
We discuss an approach for creating a federated network simulation that eases the burdens on the simulator user that typically arise from more traditional methods for defining sp...
George F. Riley, Talal M. Jaafar, Richard M. Fujim...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 26 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner
IWQOS
2004
Springer
14 years 26 days ago
Robust communications for sensor networks in hostile environments
— Clustering sensor nodes increases the scalability and energy efficiency of communications among them. In hostile environments, unexpected failures or attacks on cluster heads ...
Ossama Younis, Sonia Fahmy, Paolo Santi