1565 search results - page 121 / 313 » cluster 2006 |
131
Voted
DAWAK
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Individual privacy will be at risk if a published data set is not properly de-identified. k-anonymity is a major technique to de-identify a data set. A more general view ...
101
Voted
JUCS
2007
15 years 19 days ago
2007
: The distribution of overlaps of solutions of a random constraint satisfaction problem (CSP) is an indicator of the overall geometry of its solution space. For random k-SAT, nonri...
107
click to vote
PRL
2008
15 years 6 days ago
2008
This article introduces a scheme for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring groups in the data. T...
115
click to vote
DKE
2007
15 years 21 days ago
2007
Current studies on the storage of XML data are focused on either the efficient mapping of XML data onto an existing RDBMS or the development of a native XML storage. Some native X...
ICPADS
2006
IEEE
15 years 6 months ago
2006
IEEE
We describe Fountain, an implementation of the Scalable Systems Software node monitor specification targeted at aggregate node monitoring for clusters. Fountain is designed from ...