727 search results - page 88 / 146 » Private approximation of search problems |
120
click to vote
KDD
2010
ACM
14 years 11 months ago
2010
ACM
Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted calamities. A critical problem in a crisis situation is how t...
124
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
88
Voted
JDA
2007
15 years 20 days ago
2007
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
104
Voted
ICCV
2011
IEEE
14 years 23 days ago
2011
IEEE
It has been shown repeatedly that iterative relevance feedback is a very efficient solution for content-based image retrieval. However, no existing system scales gracefully to hu...
122
Voted
TALG
2010
14 years 7 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...