Sciweavers

140 search results - page 15 / 28
» Clustering via Matrix Powering
Sort
View
GLOBECOM
2008
IEEE
14 years 5 months ago
Distributed Base Station Cooperation via Block-Diagonalization and Dual-Decomposition
Abstract—It has been recently shown that base station cooperation may yield great capacity improvement in downlink multiple antenna cellular networks. However, the proposed solut...
Yosia Hadisusanto, Lars Thiele, Volker Jungnickel
PVG
2003
IEEE
164views Visualization» more  PVG 2003»
14 years 4 months ago
From Cluster to Wall with VTK
This paper describes a new set of parallel rendering components for VTK, the Visualization Toolkit. The parallel rendering units allow for the rendering of vast quantities of geom...
Kenneth Moreland, David Thompson
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
15 years 3 months ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
Mean shift clustering is a powerful unsupervised data analysis technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of th...
Oncel Tuzel, Fatih Porikli, Peter Meer
KDD
2002
ACM
154views Data Mining» more  KDD 2002»
14 years 11 months ago
Mining Protein Contact Maps
The 3D conformation of a protein may be compactly represented in a symmetrical, square, boolean matrix of pairwise, inter-residue contacts, or "contact map". The contact...
Jingjing Hu, Xiaolan Shen, Yu Shao, Chris Bystroff...
CEC
2005
IEEE
14 years 4 months ago
Multiobjective clustering around medoids
Abstract- The large majority of existing clustering algorithms are centered around the notion of a feature, that is, individual data items are represented by their intrinsic proper...
Julia Handl, Joshua D. Knowles