41 search results - page 5 / 9 » Approximate Integer Decompositions for Undirected Network De... |
95
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
111
click to vote
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—Network flow models serve as a popular mathematical framework for the analysis and optimization of Multi-hop Wireless Networks. They also serve to provide the understan...
94
Voted
ESA
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
101
click to vote
EWSN
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. We address the problem of designing practical, energy-efficient protocols for data collection in wireless sensor networks using predictive modeling. Prior work has sugges...
110
Voted
SIAMDM
2010
14 years 6 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...