Searching for "Private Approximation of Search Problems." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Private approximation of search problems
by Amos Beimel, Paz Carmi, Kobbi Nissim, Enav Weinreb — 2006 — In Proc. of the 38th STOC
… Private Approximation of Search Problems* Amos Beimel# Paz Carmi Kobbi Nissim Enav Weinreb…
Cited by 5 (3 self) – Add To MetaCart

K.: Private approximation of clustering and vertex
by Amos Beimel, Renen Hallak, Kobbi Nissim — 2007
… of choosing to compute private approximations for these search problems, i.e., approximation algorithms…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB