Sciweavers

318 search results - page 17 / 64
» Preimage Relations and Their Matrices
Sort
View
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 8 months ago
Linear programming bounds for unitary space time codes
The linear programming method is applied to the space Un(C) of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theore...
Jean Creignou, Hervé Diet
DM
2008
105views more  DM 2008»
13 years 8 months ago
Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope
We determine the number of alternating parity sequences that are subsequences of an increasing m-tuple of integers. For this and other related counting problems we find formulas th...
C. M. da Fonseca, E. Marques De Sá
DM
2008
63views more  DM 2008»
13 years 8 months ago
All triples for orthogonal designs of order 40
The use of amicable sets of eight circulant matrices and four negacyclic matrices to generate orthogonal designs is relatively new. We find all 1841 possible orthogonal designs of...
Wolf H. Holzmann, Hadi Kharaghani, Behruz Tayfeh-R...
BMCBI
2006
130views more  BMCBI 2006»
13 years 8 months ago
An interactive visualization tool to explore the biophysical properties of amino acids and their contribution to substitution ma
Background: Quantitative descriptions of amino acid similarity, expressed as probabilistic models of evolutionary interchangeability, are central to many mainstream bioinformatic ...
Blazej Bulka, Marie desJardins, Stephen J. Freelan...
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
14 years 6 months ago
Efficiently Decodable Non-adaptive Group Testing
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Piotr Indyk, Hung Q. Ngo, Atri Rudra