5595 search results - page 468 / 1119 » Approximation Algorithms for Clustering Problems |
237
click to vote
CVPR
2004
IEEE
16 years 9 months ago
2004
IEEE
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
182
click to vote
IPPS
2006
IEEE
16 years 1 months ago
2006
IEEE
A new class of parallel normalized preconditioned conjugate gradient type methods in conjunction with normalized approximate inverses algorithms, based on normalized approximate f...
244
click to vote
ECCV
2008
Springer
16 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
220
click to vote
ACAL
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper illustrates how the Quadratic Assignment Problem (QAP) is used as a mathematical model that helps to produce a visualization of microarray data, based on the r...
281
click to vote
CVPR
2011
IEEE
15 years 5 months ago
2011
IEEE
Where does the sparsity in image signals come from? Local and nonlocal image models have supplied complementary views toward the regularity in natural images the former attempts t...