387 search results - page 9 / 78 » Beyond Pairwise Clustering |
BIBE
2008
IEEE
14 years 1 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
JISE
2010
13 years 2 months ago
2010
CCGRID
2009
IEEE
14 years 2 months ago
2009
IEEE
ICDM
2005
IEEE
14 years 29 days ago
2005
IEEE
We propose a new theoretical framework for generalizing the traditional notion of covariance. First, we discuss the role of pairwise cross-cumulants by introducing a cluster expan...
ICCV
2009
IEEE
15 years 10 days ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...