866 search results - page 83 / 174 » Networked Slepian-Wolf: Theory and Algorithms |
175
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
197
click to vote
IPSN
2007
Springer
16 years 15 days ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
168
click to vote
PODC
2006
ACM
16 years 9 days ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
150
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
143
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...