224 search results - page 38 / 45 » Homogeneous Decomposition of Polynomials |
CP
2004
Springer
14 years 3 months ago
2004
Springer
We have started a systematic study of global constraints on set and multiset variables. We consider here disjoint, partition, and intersection constraints in conjunction with cardi...
FCT
2009
Springer
14 years 1 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
CRYPTO
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. In this paper, we study the security of 2Rschemes [17,18], which are the "minus variant" of two-round schemes. This variant consists in removing some of the n p...
IJCAI
1997
13 years 11 months ago
1997
This paper presents an algorithm for extract ing propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural networ...
COMBINATORICA
2008
13 years 10 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...