824 search results - page 47 / 165 » Efficient Distance Computation Between Non-Convex Objects |
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
JMIV
2006
13 years 8 months ago
2006
Studying large deformations with a Riemannian approach has been an efficient point of view to generate metrics between deformable objects, and to provide accurate, non ambiguous an...
EMMCVPR
2007
Springer
14 years 20 hour ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
NIPS
2004
13 years 9 months ago
2004
In this paper we propose an efficient algorithm for reducing a large mixture of Gaussians into a smaller mixture while still preserving the component structure of the original mod...