5595 search results - page 98 / 1119 » Approximation Algorithms for Clustering Problems |
156
click to vote
ISAAC
2000
Springer
15 years 8 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
167
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
127
click to vote
SSDBM
2010
IEEE
15 years 9 months ago
2010
IEEE
Abstract. Scientists’ ability to generate and collect massive-scale datasets is increasing. As a result, constraints in data analysis capability rather than limitations in the av...
126
click to vote
NIPS
2003
15 years 6 months ago
2003
A novel approach to combining clustering and feature selection is presented. It implements a wrapper strategy for feature selection, in the sense that the features are directly se...
156
click to vote
ICCSA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...