570 search results - page 77 / 114 » Approximating Some Network Design Problems with Node Costs |
141
click to vote
HPCC
2007
Springer
16 years 3 days ago
2007
Springer
In mobile-AdHoc networks (MANETs), many applications need the support of layer-structure. Clustering solution is the most widely used layerstructure and the choosing of clusterhead...
167
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
151
click to vote
COMCOM
2010
15 years 4 months ago
2010
—In this paper, we study the trade-off between network throughput and fairness in a multi-channel enabled WSN. Traditional approaches attempt to solve the two problems in an isol...
171
click to vote
IJWIN
2006
15 years 6 months ago
2006
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
179
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Coalescence, meaning the tracker associates more than one trajectories to some targets while loses track for others, is a challenging problem for visual tracking of multiple targe...