6142 search results - page 61 / 1229 » The Complexity of Partition Functions |
COMBINATORICS
2002
14 years 9 months ago
2002
Fix a rectangular Young diagram R, and consider all the products of Schur functions ssc , where and c run over all (unordered) pairs of partitions which are complementary with re...
JCT
2010
14 years 8 months ago
2010
Combinatorial proofs are given for certain entries in Ramanujan’s lost notebook. Bijections of Sylvester, Franklin, Wright, and Yee are employed. A new bijection, involving the n...
MCS
2000
Springer
15 years 1 months ago
2000
Springer
Various methods exist for reducing correlation between classifiers in a multiple classifier framework. The expectation is that the composite classifier will exhibit improved perfor...
DFT
2005
IEEE
15 years 3 months ago
2005
IEEE
The present paper proposes a new method for detecting arbitrary faults in a functional circuit when the set of codewords is limited and known in advance. The method is based on im...
ASPDAC
1999
ACM
15 years 2 months ago
1999
ACM
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...