727 search results - page 94 / 146 » Private approximation of search problems |
108
Voted
WINE
2009
Springer
15 years 7 months ago
2009
Springer
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
80
Voted
SRDS
2006
IEEE
15 years 6 months ago
2006
IEEE
In order to safeguard a sensitive database, we must ensure both its privacy and its longevity. However, privacy and longevity tend to be competing objectives. We show how to desig...
87
Voted
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
KDD
2008
ACM
16 years 1 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
106
Voted
EMO
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...