Results 1  10
of
1,714
Private Approximation of Search Problems
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY
, 2005
"... 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 design algorithms which do not leak unnecessary information. Specifically, we are interested in private approximation algor ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
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 design algorithms which do not leak unnecessary information. Specifically, we are interested in private approximation
Polylogarithmic private approximations and efficient matching
, 2005
"... In [12] a private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about x other than what can be deduced from f(x). We give the first twoparty private approximation of the l2 distance with polylogarithmic ..."
Abstract

Cited by 39 (3 self)
 Add to MetaCart
In [12] a private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about x other than what can be deduced from f(x). We give the first twoparty private approximation of the l2 distance with polylogarithmic
Private Approximation of the Set Cover Problem
, 2006
"... Private approximation, introduced by Feigenbaum, Ishai, Malkin, Nissim, Strauss, and Wright, allows us to find approximate solutions with disclosing as little information as possible. In STOC 2006, Beimel, Carmi, Nissim, and Weinreb studied the private approximation for both the vertex cover and the ..."
Abstract
 Add to MetaCart
Private approximation, introduced by Feigenbaum, Ishai, Malkin, Nissim, Strauss, and Wright, allows us to find approximate solutions with disclosing as little information as possible. In STOC 2006, Beimel, Carmi, Nissim, and Weinreb studied the private approximation for both the vertex cover
Differentially Private Approximation Algorithms
 In Proceedings of the ACMSIAM Symposium on Discrete Algorithms
, 2010
"... 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 from the clients to their nearest facility. This is just the wellstudied kmedian problem, for which many approximation algorithms ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
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 from the clients to their nearest facility. This is just the wellstudied kmedian problem, for which many approximation
Private Approximate Heavy Hitters
, 2006
"... We consider the problem of private computation of approximate Heavy Hitters. Alice and Bob each hold a vector and, in the vector sum, they want to find the B largest values along with their indices. While the exact problem requires linear communication, protocols in the literature solve this problem ..."
Abstract
 Add to MetaCart
We consider the problem of private computation of approximate Heavy Hitters. Alice and Bob each hold a vector and, in the vector sum, they want to find the B largest values along with their indices. While the exact problem requires linear communication, protocols in the literature solve
Polylogarithmic Private Approximations and Efficient Matching
"... Abstract. In [12] a private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about x other than what can be deduced from f(x). We give the first twoparty private approximation of the l2 distance with polylo ..."
Abstract
 Add to MetaCart
Abstract. In [12] a private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about x other than what can be deduced from f(x). We give the first twoparty private approximation of the l2 distance
Polylogarithmic Private Approximations and Efficient Matching
"... Abstract In [12] a private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about x other than what can be deducedfrom f (x). We give the first twoparty private approximation of the l2 distance with polylo ..."
Abstract
 Add to MetaCart
Abstract In [12] a private approximation of a function f is defined to be another function F that approximates f in the usual sense, but does not reveal any information about x other than what can be deducedfrom f (x). We give the first twoparty private approximation of the l2 distance
Bolivian Capitalization and Privatization: Approximation to an Evaluation
"... The wave of privatizations Latin America experienced during the 1990s was integral to stabilization programs and a general reordering of states ’ roles in the regional economy. Over the past few years, however, these privatizations have come under increasing fire. Their purported adverse effects ran ..."
Abstract
 Add to MetaCart
The wave of privatizations Latin America experienced during the 1990s was integral to stabilization programs and a general reordering of states ’ roles in the regional economy. Over the past few years, however, these privatizations have come under increasing fire. Their purported adverse effects
Results 1  10
of
1,714