569 search results - page 95 / 114 » An efficient clustering method for k-anonymization |
WWW
2008
ACM
14 years 9 months ago
2008
ACM
The success and popularity of social network systems, such as del.icio.us, Facebook, MySpace, and YouTube, have generated many interesting and challenging problems to the research...
KDD
2004
ACM
14 years 9 months ago
2004
ACM
In this paper, we define and study a novel text mining problem, which we refer to as Comparative Text Mining (CTM). Given a set of comparable text collections, the task of compara...
EDBT
2008
ACM
14 years 8 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
EUROSYS
2007
ACM
14 years 5 months ago
2007
ACM
We present a memory-aware load balancing (MALB) technique to dispatch transactions to replicas in a replicated database. Our MALB algorithm exploits knowledge of the working sets ...
HPDC
2007
IEEE
14 years 15 days ago
2007
IEEE
Grid applications often need to distribute large amounts of data efficiently from one cluster to multiple others (multicast). Existing methods usually arrange nodes in optimized t...