Sciweavers

2636 search results - page 200 / 528
» Linear Programming
Sort
View
119
Voted
CCCG
2008
15 years 4 months ago
Polynomial irreducibility testing through Minkowski summand computation
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...
Deepanjan Kesh, Shashank K. Mehta
85
Voted
CORR
2008
Springer
80views Education» more  CORR 2008»
15 years 2 months ago
A Dual Polynomial for OR
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 ...
Robert Spalek
111
Voted
DAM
2010
120views more  DAM 2010»
15 years 2 months ago
A new approximation algorithm for the multilevel facility location problem
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 ...
Adriana Felicia Gabor, Jan-Kees C. W. van Ommeren
135
Voted
EUROCAST
2007
Springer
133views Hardware» more  EUROCAST 2007»
15 years 6 months ago
Temporal Equilibrium Logic: A First Approach
In this paper we introduce an extension of Equilibrium Logic (a logical characterisation of the Answer Set Semantics for logic programs) consisting in the inclusion of modal tempor...
Pedro Cabalar, Gilberto Pérez Vega
180
Voted
POPL
2012
ACM
13 years 10 months ago
Probabilistic relational reasoning for differential privacy
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
Gilles Barthe, Boris Köpf, Federico Olmedo, S...