195 search results - page 25 / 39 » Clustering-Based K-Anonymisation Algorithms |
123
click to vote
ATAL
2009
Springer
15 years 5 months ago
2009
Springer
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs fac...
110
Voted
CASES
2001
ACM
15 years 5 months ago
2001
ACM
In this paper we describe a design exploration methodology for clustered VLIW architectures. The central idea of this work is a set of three techniques aimed at reducing the cost ...
106
click to vote
COMAD
2008
15 years 3 months ago
2008
Distance measure plays an important role in clustering data points. Choosing the right distance measure for a given dataset is a non-trivial problem. In this paper, we study vario...
120
click to vote
VISSYM
2003
15 years 3 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
106
click to vote
SOCO
2008
Springer
15 years 1 months ago
2008
Springer
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...