Sciweavers

710 search results - page 23 / 142
» On Minimum Power Connectivity Problems
Sort
View
SECON
2008
IEEE
14 years 2 months ago
Deploying Directional Sensor Networks with Guaranteed Connectivity and Coverage
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
Xiaofeng Han, Xiang Cao, Errol L. Lloyd, Chien-Chu...
MIAR
2010
IEEE
13 years 6 months ago
DTI Connectivity by Segmentation
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...
Marc Niethammer, Alexis Boucharin, Christopher Zac...
ICC
2008
IEEE
142views Communications» more  ICC 2008»
14 years 2 months ago
End-to-End Outage Probability Minimization in OFDM Based Linear Multi-Hop Networks
Abstract— This paper is concerned with the end-to-end transmission outage in an OFDM based wireless multi-hop network. The network consists of a source node, a destination node, ...
Xiaolu Zhang, Meixia Tao, Wenhua Jiao, Chun Sum Ng
ESANN
2000
13 years 9 months ago
An algorithm for the addition of time-delayed connections to recurrent neural networks
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
Romuald Boné, Michel Crucianu, Jean Pierre ...
CATS
1998
13 years 9 months ago
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
Weifa Liang, George Havas