Sciweavers

616 search results - page 46 / 124
» Minimum Spanning Tree Based Clustering Algorithms
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
SWARM: A Parallel Programming Framework for Multicore Processors
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
David A. Bader, Varun Kanade, Kamesh Madduri
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 7 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
CIKM
1999
Springer
13 years 12 months ago
Clustering Transactions Using Large Items
In traditional data clustering, similarity of a cluster of objects is measured by pairwise similarity of objects in that cluster. We argue that such measures are not appropriate f...
Ke Wang, Chu Xu, Bing Liu
ENDM
2010
110views more  ENDM 2010»
13 years 7 months ago
Modelling the Hop Constrained Connected Facility Location Problem on Layered Graphs
Gouveia et al. [3] show how to model the Hop Constrained Minimum Spanning tree problem as Steiner tree problem on a layered graph. Following their ideas, we provide three possibil...
Ivana Ljubic, Stefan Gollowitzer
BIBM
2008
IEEE
170views Bioinformatics» more  BIBM 2008»
14 years 2 months ago
Protein Sequence Motif Super-Rule-Tree (SRT) Structure Constructed by Hybrid Hierarchical K-Means Clustering Algorithm
— Protein sequence motifs information is crucial to the analysis of biologically significant regions. The conserved regions have the potential to determine the role of the protei...
Bernard Chen, Jieyue He, Stephen Pellicer, Yi Pan