1951 search results - page 69 / 391 » An algorithm for improving graph partitions |
140
click to vote
IEEECIT
2009
IEEE
15 years 10 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
160
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
141
click to vote
JPDC
2007
15 years 3 months ago
2007
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
130
click to vote
GRID
2004
Springer
15 years 9 months ago
2004
Springer
While resource management and task scheduling are identified challenges of Grid computing, current Grid scheduling systems mainly focus on CPU and network availability. Recent per...
132
click to vote
STOC
1998
ACM
15 years 8 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...