195 search results - page 9 / 39 » Clustering-Based K-Anonymisation Algorithms |
SAC
2005
ACM
14 years 20 days ago
2005
ACM
Peer-to-peer (P2P) has become an important computing model because of its adaptation, self-organization and autonomy etc. But efficient organization of the nodes in P2P networks i...
IDA
2007
Springer
14 years 1 months ago
2007
Springer
The Denclue algorithm employs a cluster model based on kernel density estimation. A cluster is defined by a local maximum of the estimated density function. Data points are assign...
CLUSTER
2002
IEEE
14 years 2 days ago
2002
IEEE
The join is the most important, but also the most time consuming operation in relational database systems. We implemented the parallel Hybrid Hash Join algorithm on a PC-cluster a...
VIP
2000
13 years 8 months ago
2000
This paper presents a system for graph clustering where users can visualize the clustering and give "hints" that help a computing method to find better solutions. Hints ...
ICDS
2009
IEEE
14 years 1 months ago
2009
IEEE
—In a wireless sensor network application for tracking multiple mobile targets, large amounts of sensing data can be generated by a number of sensors. These data must be controll...