Sciweavers

5056 search results - page 19 / 1012
» Network Coding Theory
Sort
View
CORR
2006
Springer
114views Education» more  CORR 2006»
13 years 10 months ago
Polynomial-time algorithms for coding across multiple unicasts
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...
Tracey Ho
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 10 months ago
Network Protection Codes: Providing Self-healing in Autonomic Networks Using Network Coding
Agile recovery from link failures in autonomic communication networks is essential to increase robustness, accessibility, and reliability of data transmission. However, this must b...
Salah A. Aly, Ahmed E. Kamal
MTA
2010
108views more  MTA 2010»
13 years 8 months ago
A reduced-reference structural similarity approximation for videos corrupted by channel errors
Abstract In this paper we propose a reduced-reference quality assessment algorithm which computes an approximation of the Structural SIMilarity (SSIM) metrics exploiting coding too...
Marco Tagliasacchi, Giuseppe Valenzise, Matteo Nac...
AML
2008
53views more  AML 2008»
13 years 10 months ago
Pairs, sets and sequences in first-order theories
In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. Firs...
Albert Visser
MOBIHOC
2007
ACM
14 years 9 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi