2652 search results - page 157 / 531 » Privacy-preserving linear programming |
139
Voted
MOR
2007
15 years 2 months ago
2007
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...
147
click to vote
IPCO
2010
15 years 1 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
108
Voted
SIAMMAX
2010
14 years 10 months ago
2010
We propose a new approach to estimate the joint spectral radius and the joint spectral subradius of an arbitrary set of matrices. We first restrict our attention to matrices that ...
241
click to vote
POPL
2008
ACM
16 years 3 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
140
click to vote
IJCAI
1989
15 years 4 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...