5595 search results - page 727 / 1119 » Approximation Algorithms for Clustering Problems |
233
click to vote
STOC
2012
ACM
13 years 9 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
191
click to vote
ISPDC
2007
IEEE
16 years 1 months ago
2007
IEEE
Mixed-parallel applications can take advantage of largescale computing platforms but scheduling them efficiently on such platforms is challenging. In this paper we compare the tw...
193
click to vote
ICA
2004
Springer
16 years 6 days ago
2004
Springer
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
221
click to vote
ENC
2004
IEEE
15 years 10 months ago
2004
IEEE
In this paper, we consider parallel tasks scheduling problems for hierarchical decentralized systems that consist of homogeneous computational resources such as clusters, PCs and ...
198
click to vote
HPDC
2008
IEEE
15 years 7 months ago
2008
IEEE
This paper describes the study conducted to design and evaluate a two-level on-line scheduler to dynamically schedule a stream of sequential and multi-threaded batch jobs on large...