696 search results - page 9 / 140 » A class of combinatorial identities |
112
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
DMIN
2009
14 years 9 months ago
2009
- This paper demonstrates how methods borrowed from information fusion can improve the performance of a classifier by constructing (i.e., fusing) new features that are combinations...
75
Voted
EJC
2010
14 years 11 months ago
2010
We start by describing all the varieties of loops Q that can be defined by autotopisms x, x Q, where x is a composition of two triples, each of which becomes an autotopism when th...
95
Voted
STOC
2005
ACM
16 years 3 hour ago
2005
ACM
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
107
click to vote
ESA
1999
Springer
15 years 4 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...