1469 search results - page 84 / 294 » Approximate polynomial decomposition |
135
click to vote
VC
2008
15 years 5 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...
128
click to vote
STOC
1999
ACM
15 years 9 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...
123
click to vote
MFCS
2004
Springer
15 years 10 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...
131
click to vote
COCO
2003
Springer
15 years 10 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 ...
136
click to vote
DIS
1998
Springer
15 years 9 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...