50 search results - page 1 / 10 » Polynomial-time algorithms for coding across multiple unicas... |
152
Voted
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of network coding across multiple unicasts. We give, for wired and wireless networks, efficient polynomial time algorithms for finding optimal network code...
155
click to vote
QOSIP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
132
Voted
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— We consider energy efficient network coding design in wireless networks with multiple unicast sessions. Our approach decomposes multiple unicast sessions into a superposition ...
143
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
151
Voted
INFOCOM
2005
IEEE
15 years 10 months ago
2005
IEEE
— With the constraints of network topologies and link capacities, achieving the optimal end-to-end throughput in data networks has been known as a fundamental but computationally...