961 search results - page 60 / 193 » Significance-Driven Graph Clustering |
168
click to vote
CCGRID
2008
IEEE
15 years 6 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...
139
click to vote
ICPADS
2006
IEEE
15 years 10 months ago
2006
IEEE
While most parallel task graphs scheduling research has been done in the context of single homogeneous clusters, heterogeneous platforms have become prevalent and are extremely at...
147
click to vote
ICPP
1999
IEEE
15 years 8 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
137
click to vote
ICDM
2002
IEEE
15 years 9 months ago
2002
IEEE
Document clustering techniques mostly rely on single term analysis of the document data set, such as the Vector Space Model. To better capture the structure of documents, the unde...
143
click to vote
PAMI
2006
15 years 4 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...