Sciweavers

181 search results - page 2 / 37
» Binary Change Set Composition
Sort
View
CORR
2006
Springer
96views Education» more  CORR 2006»
13 years 5 months ago
Upper Bounding the Performance of Arbitrary Finite LDPC Codes on Binary Erasure Channels
Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-c...
Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Po...
IPL
2011
96views more  IPL 2011»
12 years 11 months ago
Restricted compositions and permutations: From old to new Gray codes
Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let ≺ denot...
Vincent Vajnovszki, Rémi Vernay
ACS
2000
13 years 5 months ago
Free Adjunction of Morphisms
Abstract. We develop a general setting for the treatment of extensions of categories by means of freely adjoined morphisms. To this end, we study what we call composition graphs, i...
Lutz Schröder, Horst Herrlich
SEFM
2006
IEEE
13 years 11 months ago
Modeling Heterogeneous Real-time Components in BIP
We present a methodology for modeling heterogeneous real-time components. Components are obtained as the superposition of three layers : Behavior, specified as a set of transitio...
Ananda Basu, Marius Bozga, Joseph Sifakis
TIME
2007
IEEE
13 years 11 months ago
Temporal Relations of Intervals with a Gap
Forty-four relations are found between an interval and an interval with a gap ( rIIg ), capturing semantics that are distinct from those of the sets of constituting intervals and ...
Max J. Egenhofer