696 search results - page 10 / 140 » A class of combinatorial identities |
MP
2010
14 years 10 months ago
2010
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
ISSAC
2009
Springer
15 years 6 months ago
2009
Springer
We extend Zeilberger’s approach to special function identities to cases that are not holonomic. The method of creative telescoping is thus applied to definite sums or integrals...
COMBINATORICS
2004
14 years 11 months ago
2004
The Sandwich Theorems proved in this paper give a new method to show that the partition function a(n) of a partition identity A(x) := n=0 a(n)xn = n=1 (1 - xn )-p(n) satisfies t...
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
The paper discusses computationally efficient NLMS and RLS algorithms for a broad class of nonlinear filters using periodic input sequences. The class comprises all nonlinear ...