Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
Background: Non-homology based methods such as phylogenetic profiles are effective for predicting functional relationships between proteins with no considerable sequence or struct...
Ryosuke Watanabe, Enrique Morett, Edgar E. Vallejo
This paper presents a new partitioning algorithm to perform matrix multiplication on two interconnected heterogeneous processors. Data is partitioned in a way which minimizes the ...
Random Indexing K-tree is the combination of two algorithms suited for large scale document clustering. Keywords Random Indexing, K-tree, Dimensionality Reduction, B-tree, Search T...
Christopher M. De Vries, Lance De Vine, Shlomo Gev...
Clustering video sequences in order to infer and extract activities from a single video stream is an extremely important problem and has significant potential in video indexing, s...
Pavan K. Turaga, Ashok Veeraraghavan, Rama Chellap...