195 search results - page 14 / 39 » Clustering-Based K-Anonymisation Algorithms |
79
Voted
SIGIR
2003
ACM
15 years 2 months ago
2003
ACM
In this paper, we propose a novel document clustering method based on the non-negative factorization of the termdocument matrix of the given document corpus. In the latent semanti...
ICC
2007
IEEE
15 years 1 months ago
2007
IEEE
As the radio spectrum usage paradigm shifting from the traditional command and control allocation scheme to the open spectrum allocation scheme, wireless mesh networks meet new opp...
102
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In P2P systems, large volumes of data are declustered naturally across a large number of peers. But it is very difficult to control the initial data distribution because every use...
JMLR
2011
14 years 4 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper presents a low-cost tracking algorithm based on multiple multiple fragments, increasing robustness with respect to partial occlusions. Given the initial template repres...