5595 search results - page 83 / 1119 » Approximation Algorithms for Clustering Problems |
145
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
137
click to vote
PRL
2008
15 years 4 months ago
2008
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
116
click to vote
ESWA
2010
15 years 2 months ago
2010
1 In this study, a novel robust clustering algorithm, robust interval competitive agglomeration (RICA) clustering algorithm, is proposed to overcome the problems of the outliers, t...
148
Voted
CVPR
2010
IEEE
16 years 27 days ago
2010
IEEE
The dynamic texture (DT) is a probabilistic generative model, defined over space and time, that represents a video as the output of a linear dynamical system (LDS). The DT model ...
161
click to vote
CIAC
2003
Springer
15 years 8 months ago
2003
Springer
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...