5046 search results - page 728 / 1010 » Non-redundant data clustering |
293
Voted
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much...
299
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
210
Voted
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
194
Voted
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
Laser based people tracking systems have been developed for mobile robotic or intelligent surveillance areas. Existing systems rely on laser point clustering to extract object loc...
213
Voted
WWW
2009
ACM
16 years 8 months ago
2009
ACM
There has recently been an upsurge of interest in the possibilities of combining structured data and ad-hoc information retrieval from traditional hypertext. In this experiment, w...