Sciweavers

727 search results - page 88 / 146
» Private approximation of search problems
Sort
View
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 8 months ago
Using data mining techniques to address critical information exchange needs in disaster affected public-private networks
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...
Li Zheng, Chao Shen, Liang Tang, Tao Li, Steven Lu...
ASIACRYPT
2010
Springer
13 years 8 months ago
Structured Encryption and Controlled Disclosure
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 ...
Melissa Chase, Seny Kamara
JDA
2007
73views more  JDA 2007»
13 years 9 months ago
Parameterized matching with mismatches
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...
Alberto Apostolico, Péter L. Erdös, Mo...
ICCV
2011
IEEE
12 years 10 months ago
HEAT: Iterative Relevance Feedback with One Million Images
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...
Nicolae Suditu, Francois Fleuret
TALG
2010
158views more  TALG 2010»
13 years 4 months ago
Clustering for metric and nonmetric distance measures
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...
Marcel R. Ackermann, Johannes Blömer, Christi...