5595 search results - page 253 / 1119 » Approximation Algorithms for Clustering Problems |
193
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
196
click to vote
SODA
1998
ACM
15 years 7 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
159
click to vote
NIPS
2003
15 years 7 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...
200
click to vote
DATAMINE
2006
15 years 6 months ago
2006
With the growing importance of time series clustering research, particularly for similarity searches amongst long time series such as those arising in medicine or finance, it is cr...
183
Voted
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
Subspace segmentation is the task of segmenting data
lying on multiple linear subspaces. Its applications in
computer vision include motion segmentation in video,
structure-from...