Sciweavers

396 search results - page 56 / 80
» Scalability for Clustering Algorithms Revisited
Sort
View
CLUSTER
2005
IEEE
15 years 5 months ago
Load Balancing using Grid-based Peer-to-Peer Parallel I/O
In the area of Grid computing, there is a growing need to process large amounts of data. To support this trend, we need to develop efficient parallel storage systems that can prov...
Yijian Wang, David R. Kaeli
IPPS
2000
IEEE
15 years 4 months ago
Parallel Information Retrieval on an SCI-Based PC-NOW
This paper presents an efficient parallel information retrieval (IR) system which provides fast information service for the Internet users on lowcost high-performance PC-NOW enviro...
Sang-Hwa Chung, Hyuk-Chul Kwon, Kwang Ryel Ryu, Ha...
VCIP
2003
170views Communications» more  VCIP 2003»
15 years 1 months ago
How good are the visual MPEG-7 features?
The study presented in this paper analyses descriptions extracted with MPEG-7-descriptors from visual content from the statistical point of view. Good descriptors should generate ...
Horst Eidenberger
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
15 years 6 months ago
Hunting for Coherent Co-clusters in High Dimensional and Noisy Datasets
Clustering problems often involve datasets where only a part of the data is relevant to the problem, e.g., in microarray data analysis only a subset of the genes show cohesive exp...
Meghana Deodhar, Joydeep Ghosh, Gunjan Gupta, Hyuk...
EDBT
2008
ACM
154views Database» more  EDBT 2008»
15 years 12 months ago
Data utility and privacy protection trade-off in k-anonymisation
K-anonymisation is an approach to protecting privacy contained within a dataset. A good k-anonymisation algorithm should anonymise a dataset in such a way that private information...
Grigorios Loukides, Jianhua Shao