616 search results - page 4 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
DEXA
2010
Springer
13 years 5 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
ASPDAC
2001
ACM
13 years 8 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
BMCBI
2004
13 years 4 months ago
2004
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
ALGORITHMICA
2010
13 years 5 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
SAC
2009
ACM
13 years 9 months ago
2009
ACM
During a disaster, emergency response operations can benefit from the establishment of a wireless ad hoc network. We propose the use of autonomous robots that move inside a disas...