2652 search results - page 213 / 531 » Privacy-preserving linear programming |
128
Voted
CCCG
2008
15 years 5 months ago
2008
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
107
Voted
ESANN
2000
15 years 5 months ago
2000
Abstract. This paper proposes a mathematical programming framew ork for combining SVMs with possibly di erent kernels. Compared to single SVMs, the advantage of this approach is tw...
95
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
118
Voted
DAM
2010
15 years 3 months ago
2010
In this paper we propose a new integer programming formulation for the multilevel facility location problem and a novel 3-approximation algorithm based on LP rounding. The linear ...
111
Voted
MP
2007
15 years 3 months ago
2007
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...