796 search results - page 51 / 160 » Approximating the centroid is hard |
PODS
2012
ACM
11 years 10 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
AAAI
2004
13 years 9 months ago
2004
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general prob...
ECCC
2008
13 years 7 months ago
2008
We construct public-key cryptosystems that are secure assuming the worst-case hardness of approximating the minimum distance on n-dimensional lattices to within small poly(n) fact...
STOC
2006
ACM
14 years 8 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...