627 search results - page 110 / 126 » Privacy-Preserving k-NN for Small and Large Data Sets |
ICCV
2011
IEEE
13 years 11 months ago
2011
IEEE
We present a generic, efficient and iterative algorithm for interactively clustering classes of images and videos. The approach moves away from the use of large hand labelled tra...
WWW
2010
ACM
15 years 6 months ago
2010
ACM
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
AI
2010
Springer
14 years 11 months ago
2010
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, settings where agents are distributed and have privacy issues, or ...
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
118
click to vote
ASIAN
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...