Sciweavers

19 search results - page 1 / 4
» Parity Versions of 2-Connectedness
Sort
View
COMBINATORICS
2006
100views more  COMBINATORICS 2006»
13 years 4 months ago
Parity Versions of 2-Connectedness
This paper introduces parity versions of familiar graph theoretic results, in particular results related to 2-connectedness. The even and odd circuit connected graphs are characte...
C. Little, A. Vince
ICC
2009
IEEE
122views Communications» more  ICC 2009»
13 years 11 months ago
Subset Selection in Type-II Hybrid ARQ/FEC for Video Multicast
—This paper proposes an error control scheme that minimizes the total distortion experienced by the receivers using a version of Type-II hybrid ARQ/FEC. Based on the feedback inf...
S. Mohsen Amiri, Ivan V. Bajic
ICIP
2010
IEEE
13 years 1 months ago
Multi-stream partitioning and parity rate allocation for scalable IPTV delivery
We address the joint problem of clustering heterogenous clients and allocating scalable video source rate and FEC redundancy in IPTV systems. We propose a streaming solution that ...
Jacob Chakareski, Pascal Frossard
TCOM
2011
170views more  TCOM 2011»
12 years 11 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...
CORR
2007
Springer
135views Education» more  CORR 2007»
13 years 4 months ago
Settling the Complexity of Computing Two-Player Nash Equilibria
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
Xi Chen, Xiaotie Deng, Shang-Hua Teng