5595 search results - page 167 / 1119 » Approximation Algorithms for Clustering Problems |
155
click to vote
EDBT
2004
ACM
16 years 5 months ago
2004
ACM
Abstract. Clustering is a problem of great practical importance in numerous applications. The problem of clustering becomes more challenging when the data is categorical, that is, ...
135
click to vote
ICDM
2003
IEEE
15 years 10 months ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
179
click to vote
CCGRID
2008
IEEE
15 years 7 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
145
click to vote
WINE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
160
click to vote
BMCBI
2008
15 years 5 months ago
2008
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...