5595 search results - page 176 / 1119 » Approximation Algorithms for Clustering Problems |
170
click to vote
CVPR
2004
IEEE
16 years 7 months ago
2004
IEEE
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
140
click to vote
WSC
2008
15 years 7 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...
156
click to vote
COCOA
2009
Springer
15 years 8 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
162
Voted
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
In this paper, we explore the discriminating subsequencebased clustering problem. First, several effective optimization techniques are proposed to accelerate the sequence mining p...
122
Voted
DATAMINE
2007
15 years 5 months ago
2007
Recent work has looked at extending clustering algorithms with instance level must-link (ML) and cannot-link (CL) background information. Our work introduces δ and ǫ cluster lev...