195 search results - page 9 / 39 » Clustering-Based K-Anonymisation Algorithms |
141
click to vote
SAC
2005
ACM
15 years 9 months 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...
146
click to vote
IDA
2007
Springer
15 years 10 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...
136
click to vote
CLUSTER
2002
IEEE
15 years 9 months 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...
146
click to vote
VIP
2000
15 years 5 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 ...
127
click to vote
ICDS
2009
IEEE
15 years 11 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...