2652 search results - page 65 / 531 » Privacy-preserving linear programming |
ICDAR
2007
IEEE
15 years 4 months ago
2007
IEEE
AAIM
2007
Springer
15 years 4 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
110
click to vote
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...