195 search results - page 3 / 39 » Clustering-Based K-Anonymisation Algorithms |
ASPDAC
1999
ACM
13 years 10 months ago
1999
ACM
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
EUROPAR
2004
Springer
13 years 11 months ago
2004
Springer
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of cl...
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
Two efficient clustering-based genetic algorithms are developed for the optimisation of reaction rate parameters in chemical kinetic modelling. The genetic algorithms employed are ...
CEC
2008
IEEE
14 years 13 days ago
2008
IEEE
—Correlation clustering problem is a NP hard problem and technologies for the solving of correlation clustering problem can be used to cluster given data set with relation matrix...
DEXA
2007
Springer
14 years 4 days ago
2007
Springer
Abstract. K-anonymisation is an approach to protecting private information contained within a dataset. Many k-anonymisation methods have been proposed recently and one class of suc...