1469 search results - page 84 / 294 » Approximate polynomial decomposition |
VC
2008
14 years 9 months ago
2008
We present a method for solving arbitrary systems of N nonlinear polynomials in n variables over an n-dimensional simplicial domain based on polynomial representation in the baryce...
STOC
1999
ACM
15 years 2 months ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this work, we consider an interesting variant of the wellstudied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [3...
COCO
2003
Springer
15 years 3 months ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
DIS
1998
Springer
15 years 2 months ago
1998
Springer
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...