Sciweavers

4039 search results - page 277 / 808
» A Method for Dynamic Clustering of Data
Sort
View
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
16 years 7 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
PAISI
2010
Springer
15 years 4 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
HPCA
2008
IEEE
16 years 7 months ago
C-Oracle: Predictive thermal management for data centers
Designing thermal management policies for today's power-dense server clusters is currently a challenge, since it is difficult to predict the exact temperature and performance...
Luiz Ramos, Ricardo Bianchini
ICCSA
2004
Springer
16 years 1 days ago
A Sequence-Focused Parallelisation of EMBOSS on a Cluster of Workstations
Abstract. A number of individual bioinformatics applications (particularly BLAST and other sequence searching methods) have recently been implemented over clusters of workstations ...
Karl Podesta, Martin Crane, Heather J. Ruskin
ICAPR
2001
Springer
15 years 11 months ago
Image Retrieval Using a Hierarchy of Clusters
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchi...
Daniela Stan, Ishwar K. Sethi