Sciweavers

83 search results - page 14 / 17
» Scalable Clustering Algorithms with Balancing Constraints
Sort
View
DAWAK
2006
Springer
13 years 11 months ago
Achieving k-Anonymity by Clustering in Attribute Hierarchical Structures
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 ...
Jiuyong Li, Raymond Chi-Wing Wong, Ada Wai-Chee Fu...
IPPS
1996
IEEE
13 years 12 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
HIS
2003
13 years 9 months ago
Design of Transparent Mamdani Fuzzy Inference Systems
: In this paper, we propose a technique to design Fuzzy Inference Systems (FIS) of Mamdani type with transparency constraints. The technique is based on our Crisp Double Clustering...
Giovanna Castellano, Anna Maria Fanelli, Corrado M...
ICDE
2009
IEEE
155views Database» more  ICDE 2009»
14 years 9 months ago
Finding Time-Lagged 3D Clusters
Existing 3D clustering algorithms on gene ? sample ? time expression data do not consider the time lags between correlated gene expression patterns. Besides, they either ignore the...
Xin Xu, Ying Lu, Kian-Lee Tan, Anthony K. H. Tung
ICC
2007
IEEE
124views Communications» more  ICC 2007»
14 years 2 months ago
On Achieving Maximum Network Lifetime Through Optimal Placement of Cluster-heads in Wireless Sensor Networks
—In a wireless sensor network, the network lifetime is an important issue when the size of the network is large. In order to make the network scalable, it is divided into a numbe...
Marudachalam Dhanaraj, C. Siva Ram Murthy