450 search results - page 70 / 90 » Satisfiability with Exponential Families |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We construct fast algorithms for evaluating transforms associated with families of functions which satisfy recurrence relations. These include algorithms both for computing the co...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
— A construction of a new family of distributed space time codes (DSTCs) having full diversity and low Maximum Likelihood (ML) decoding complexity is provided for the two phase b...
102
click to vote
JCT
2006
14 years 11 months ago
2006
We construct a new 2-parameter family Emn, m, n 3, of self-dual 2-simple and 2-simplicial 4-polytopes, with flexible geometric realisations. E44 is the 24-cell. For large m, n the...
ORDER
2006
14 years 11 months ago
2006
Let r be a fixed positive integer. It is shown that, given any partial orders >1, . . ., >r on the same n-element set P, there exist disjoint subsets A, B P, each with at l...
101
click to vote
LOGCOM
2010
14 years 10 months ago
2010
This paper has two purposes. The first is to present a final coalgebra construction for finitary endofunctors on Set that uses a certain subset L∗ of the limit L of the firs...