5595 search results - page 26 / 1119 » Approximation Algorithms for Clustering Problems |
108
click to vote
COCOA
2008
Springer
15 years 4 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
136
click to vote
RTCSA
2003
IEEE
15 years 7 months ago
2003
IEEE
Network of workstation (NOW) is a cost-effective alternative to massively parallel supercomputers. As commercially available off-theshelf processors become cheaper and faster, it...
133
Voted
KDD
1997
ACM
15 years 6 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
93
Voted
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
In this paper we present a generative model and learning procedure for unsupervised video clustering into scenes. The work addresses two important problems: realistic modeling of ...