847 search results - page 56 / 170 » Approximation algorithms for projective clustering |
PR
2008
15 years 17 days ago
2008
In this paper, we extend the conventional vector quantization by incorporating a vigilance parameter, which steers the tradeoff between plasticity and stability during incremental...
95
Voted
CSB
2005
IEEE
15 years 6 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
107
Voted
HICSS
2008
IEEE
15 years 7 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
110
click to vote
PAMI
2011
14 years 7 months ago
2011
Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms such as k-means. However, spectral clustering suffers fro...
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
In this work we revisit the Mumford-Shah functional, one of the most studied variational approaches to image segmentation. The contribution of this paper is to propose an algorith...