727 search results - page 9 / 146 » Private approximation of search problems |
SODA
2010
ACM
14 years 7 months ago
2010
ACM
In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budg...
CONIELECOMP
2005
IEEE
14 years 3 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider robust network design problems where the set of feasible demands may be given by an arbitrary polytope or convex body more generally. This model, introduced by BenAmeu...
ESA
2010
Springer
13 years 11 months ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...