Sciweavers

32 search results - page 4 / 7
» Optimal broadcast domination in polynomial time
Sort
View
SECON
2010
IEEE
13 years 4 months ago
Multi-Constrained Anypath Routing in Wireless Mesh Networks
Anypath routing has been proposed to improve the performance of unreliable wireless networks by exploiting the spatial diversity and broadcast nature of the wireless medium. In thi...
Xi Fang, Dejun Yang, Pritam Gundecha, Guoliang Xue
WINET
2010
146views more  WINET 2010»
13 years 4 months ago
Allocating data for broadcasting over wireless channels subject to transmission errors
Broadcasting is an efficient and scalable way of transmitting data over wireless channels to an unlimited number of clients. In this paper the problem of allocating data to multip...
Paolo Barsocchi, Alan A. Bertossi, Maria Cristina ...
DATE
2007
IEEE
101views Hardware» more  DATE 2007»
14 years 19 days ago
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
Paolo Bonzini, Laura Pozzi
GLOBECOM
2010
IEEE
13 years 4 months ago
Diversity Embedded Streaming Erasure Codes (DE-SCo): Constructions and Optimality
Streaming erasure codes encode a source stream to guarantee that each source packet is recovered within a fixed delay at the receiver over a burst-erasure channel. This paper intro...
Ahmed Badr, Ashish Khisti, Emin Martinian
INFOCOM
2005
IEEE
13 years 12 months ago
On achieving optimal throughput with network coding
— 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...
Zongpeng Li, Baochun Li, Dan Jiang, Lap Chi Lau