22 search results - page 2 / 5 » Private approximation of NP-hard functions |
TCC
2012
Springer
12 years 13 days ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of private efficient data mining of vertically-partitioned databases. Each of several parties holds a column of a data matrix (a vector) and the parties wan...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
The Model Checking Integrated Planning System (MIPS) has shown distinguished performance in the second and third international planning competitions. With its object-oriented fram...