24 search results - page 1 / 5 » Privacy-preserving approximation of L1 distance for multimed... |
ICMCS
2010
IEEE
13 years 6 months ago
2010
IEEE
Alice and Bob possess sequences x and y respectively and would like to compute the 1 distance, namely x - y 1 under privacy and communication constraints. The privacy constraint r...
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...
ICDE
2006
IEEE
14 years 6 months ago
2006
IEEE
Todays abundance of storage coupled with digital technologies in virtually any scientific or commercial application such as medical and biological imaging or music archives deal w...
CPM
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
NIPS
2008
13 years 6 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...