2652 search results - page 227 / 531 » Privacy-preserving linear programming |
138
Voted
SIAMJO
2000
15 years 3 months ago
2000
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
150
click to vote
INFORMS
2010
15 years 2 months ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
130
click to vote
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We propose a programming paradigm called compress-and-conquer (CC) that leads to optimal performance on multicore platforms. Given a multicore system of p cores and a problem of s...
131
click to vote
PODC
2005
ACM
15 years 9 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...
116
click to vote
KR
1998
Springer
15 years 8 months ago
1998
Springer
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...