164 search results - page 2 / 33 » On k-Anonymity and the Curse of Dimensionality |
ALENEX
2001
13 years 5 months ago
2001
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
ICDE
2000
IEEE
14 years 5 months ago
2000
IEEE
Nearest neighbor queries are important in many settings, including spatial databases (Find the k closest cities) and multimedia databases (Find the k most similar images). Previou...
ICDE
2007
IEEE
14 years 5 months ago
2007
IEEE
A key method for privacy preserving data mining is that of randomization. Unlike k-anonymity, this technique does not include public information in the underlying assumptions. In ...
SIGMOD
1998
ACM
13 years 8 months ago
1998
ACM
In this paper, we propose the Pyramid-Technique, a new indexing method for high-dimensional data spaces. The PyramidTechnique is highly adapted to range query processing using the...
CGF
2002
13 years 4 months ago
2002
In recent years subdivision methods have been one of the most successful techniques applied to the multi-resolution representation and visualization of surface meshes. Extension t...