Sciweavers

705 search results - page 13 / 141
» Proximity Cluster Trees
Sort
View
SLIP
2009
ACM
14 years 2 months ago
Honeycomb-structured computational interconnects and their scalable extension to spherical domains
The present paper is part of a larger effort to redesign, from the ground up, the best possible interconnect topologies for switchless multiprocessor computer systems. We focus he...
Joseph B. Cessna, Thomas R. Bewley
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 9 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
RIAO
2007
13 years 9 months ago
Comprehensible and Accurate Cluster Labels in Text Clustering
The purpose of text clustering in information retrieval is to discover groups of semantically related documents. Accurate and comprehensible cluster descriptions (labels) let the ...
Jerzy Stefanowski, Dawid Weiss
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
13 years 12 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu

Presentation
956views
12 years 1 months ago
A Method for Distributed Computaion of Semi-Optimal Multicast Tree in MANET
In this paper, we propose a new method to construct a semi-optimal QoS-aware multicast tree on MANET using distributed computation of the tree based on Genetic Algorithm (GA). This...