6897 search results - page 498 / 1380 » Parallelization of Modular Algorithms |
118
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
135
Voted
KDD
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
259
click to vote
POPL
2008
ACM
16 years 5 months ago
2008
ACM
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
138
click to vote
PLDI
2009
ACM
15 years 11 months ago
2009
ACM
Modern programs frequently employ sophisticated modular designs. As a result, performance problems cannot be identified from costs attributed to routines in isolation; understand...
155
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: Development of robust and efficient methods for analyzing and interpreting high dimension gene expression profiles continues to be a focus in computational biology. Th...