Sciweavers

909 search results - page 27 / 182
» On the approximability of some network design problems
Sort
View
INFOCOM
2008
IEEE
15 years 8 months ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff
SWAT
2010
Springer
242views Algorithms» more  SWAT 2010»
14 years 12 months ago
Minimizing the Diameter of a Network Using Shortcut Edges
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
Erik D. Demaine, Morteza Zadimoghaddam
COMCOM
2010
276views more  COMCOM 2010»
15 years 1 months ago
Adjustable convergecast tree protocol for wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
IPL
2006
70views more  IPL 2006»
15 years 1 months ago
A polynomial time approximation scheme for embedding a directed hypergraph on a ring
We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively stud...
Kang Li, Lusheng Wang
KES
2007
Springer
15 years 7 months ago
Design of Neural Networks
The paper offers a critical analysis of the procedure observed in many applications of neural networks. Given a problem to be solved, a favorite NN-architecture is chosen and its p...
Claudio Moraga